./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-58.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_operatoramount_amount500_file-58.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 a1b1542a0d7ba885e4ac39939a1802ee813565730a5e0b0e8c42778ed7346026 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:34:30,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:34:30,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:34:30,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:34:30,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:34:30,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:34:30,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:34:30,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:34:30,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:34:30,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:34:30,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:34:30,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:34:30,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:34:30,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:34:30,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:34:30,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:34:30,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:34:30,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:34:30,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:34:30,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:34:30,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:34:30,260 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 -> a1b1542a0d7ba885e4ac39939a1802ee813565730a5e0b0e8c42778ed7346026 [2025-03-04 00:34:30,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:34:30,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:34:30,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:34:30,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:34:30,497 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:34:30,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-58.i [2025-03-04 00:34:31,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a3121b9/487eec7319d248bc84de7e80f073cddb/FLAGd0d36bc55 [2025-03-04 00:34:31,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:34:31,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-58.i [2025-03-04 00:34:31,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a3121b9/487eec7319d248bc84de7e80f073cddb/FLAGd0d36bc55 [2025-03-04 00:34:32,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a3121b9/487eec7319d248bc84de7e80f073cddb [2025-03-04 00:34:32,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:34:32,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:34:32,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:34:32,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:34:32,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:34:32,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e28460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32, skipping insertion in model container [2025-03-04 00:34:32,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:34:32,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-58.i[916,929] [2025-03-04 00:34:32,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:34:32,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:34:32,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-58.i[916,929] [2025-03-04 00:34:32,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:34:32,744 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:34:32,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32 WrapperNode [2025-03-04 00:34:32,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:34:32,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:34:32,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:34:32,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:34:32,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,841 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 697 [2025-03-04 00:34:32,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:34:32,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:34:32,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:34:32,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:34:32,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,907 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-04 00:34:32,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:34:32,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:34:32,973 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:34:32,974 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:34:32,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (1/1) ... [2025-03-04 00:34:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:34:32,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:33,003 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-04 00:34:33,031 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-04 00:34:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:34:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:34:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:34:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:34:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:34:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:34:33,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:34:33,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:34:34,027 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc property_#t~bitwise55#1;havoc property_#t~short56#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-04 00:34:34,153 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-04 00:34:34,153 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:34:34,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:34:34,172 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:34:34,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:34 BoogieIcfgContainer [2025-03-04 00:34:34,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:34:34,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:34:34,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:34:34,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:34:34,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:34:32" (1/3) ... [2025-03-04 00:34:34,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd7cf69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:34:34, skipping insertion in model container [2025-03-04 00:34:34,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:34:32" (2/3) ... [2025-03-04 00:34:34,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd7cf69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:34:34, skipping insertion in model container [2025-03-04 00:34:34,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:34:34" (3/3) ... [2025-03-04 00:34:34,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-58.i [2025-03-04 00:34:34,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:34:34,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-58.i that has 2 procedures, 291 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:34:34,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:34:34,260 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;@197fe485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:34:34,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:34:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 291 states, 202 states have (on average 1.5247524752475248) internal successors, (308), 203 states have internal predecessors, (308), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:34:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-04 00:34:34,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:34,288 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:34,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 471168530, now seen corresponding path program 1 times [2025-03-04 00:34:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121073754] [2025-03-04 00:34:34,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:34,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-04 00:34:34,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-04 00:34:34,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:34,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-04 00:34:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121073754] [2025-03-04 00:34:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121073754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:34,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423081086] [2025-03-04 00:34:34,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:34,887 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-04 00:34:34,889 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-04 00:34:35,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-04 00:34:35,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-04 00:34:35,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:35,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:35,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:34:35,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-04 00:34:35,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:34:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423081086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:35,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:34:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:34:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688262165] [2025-03-04 00:34:35,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:34:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:34:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:34:35,308 INFO L87 Difference]: Start difference. First operand has 291 states, 202 states have (on average 1.5247524752475248) internal successors, (308), 203 states have internal predecessors, (308), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-04 00:34:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:35,369 INFO L93 Difference]: Finished difference Result 576 states and 1041 transitions. [2025-03-04 00:34:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:34:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 567 [2025-03-04 00:34:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:35,379 INFO L225 Difference]: With dead ends: 576 [2025-03-04 00:34:35,380 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 00:34:35,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 568 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-04 00:34:35,390 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:35,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:34:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 00:34:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-04 00:34:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 200 states have (on average 1.515) internal successors, (303), 200 states have internal predecessors, (303), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:34:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 475 transitions. [2025-03-04 00:34:35,474 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 475 transitions. Word has length 567 [2025-03-04 00:34:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 475 transitions. [2025-03-04 00:34:35,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-04 00:34:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 475 transitions. [2025-03-04 00:34:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-04 00:34:35,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:35,488 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:35,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:34:35,689 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-04 00:34:35,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -590997954, now seen corresponding path program 1 times [2025-03-04 00:34:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253490999] [2025-03-04 00:34:35,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:35,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-04 00:34:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-04 00:34:35,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:35,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253490999] [2025-03-04 00:34:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253490999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:34:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667707037] [2025-03-04 00:34:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:36,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:34:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:36,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:34:36,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:34:36,374 INFO L87 Difference]: Start difference. First operand 288 states and 475 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:36,488 INFO L93 Difference]: Finished difference Result 852 states and 1407 transitions. [2025-03-04 00:34:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:34:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 567 [2025-03-04 00:34:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:36,496 INFO L225 Difference]: With dead ends: 852 [2025-03-04 00:34:36,498 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 00:34:36,500 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-04 00:34:36,500 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 454 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:36,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1182 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:34:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 00:34:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 363. [2025-03-04 00:34:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 275 states have (on average 1.5818181818181818) internal successors, (435), 275 states have internal predecessors, (435), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:34:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 607 transitions. [2025-03-04 00:34:36,555 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 607 transitions. Word has length 567 [2025-03-04 00:34:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:36,559 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 607 transitions. [2025-03-04 00:34:36,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 607 transitions. [2025-03-04 00:34:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-04 00:34:36,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:36,569 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:36,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:34:36,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:36,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:36,571 INFO L85 PathProgramCache]: Analyzing trace with hash -310648065, now seen corresponding path program 1 times [2025-03-04 00:34:36,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:36,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437320492] [2025-03-04 00:34:36,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:36,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:36,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-04 00:34:36,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-04 00:34:36,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:36,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:36,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:36,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437320492] [2025-03-04 00:34:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437320492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:36,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:36,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:34:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314170406] [2025-03-04 00:34:36,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:36,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:34:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:36,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:34:36,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:34:36,931 INFO L87 Difference]: Start difference. First operand 363 states and 607 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:37,079 INFO L93 Difference]: Finished difference Result 986 states and 1652 transitions. [2025-03-04 00:34:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:34:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 567 [2025-03-04 00:34:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:37,086 INFO L225 Difference]: With dead ends: 986 [2025-03-04 00:34:37,087 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 00:34:37,088 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-04 00:34:37,089 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 286 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:37,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1158 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:34:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 00:34:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 623. [2025-03-04 00:34:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 510 states have (on average 1.607843137254902) internal successors, (820), 511 states have internal predecessors, (820), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-04 00:34:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1040 transitions. [2025-03-04 00:34:37,134 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1040 transitions. Word has length 567 [2025-03-04 00:34:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:37,134 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1040 transitions. [2025-03-04 00:34:37,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1040 transitions. [2025-03-04 00:34:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-04 00:34:37,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:37,144 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:37,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:34:37,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:37,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 569936961, now seen corresponding path program 1 times [2025-03-04 00:34:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:37,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511392856] [2025-03-04 00:34:37,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:37,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-04 00:34:37,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-04 00:34:37,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:37,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511392856] [2025-03-04 00:34:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511392856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:34:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778978884] [2025-03-04 00:34:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:37,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:34:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:37,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:34:37,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:34:37,404 INFO L87 Difference]: Start difference. First operand 623 states and 1040 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:37,525 INFO L93 Difference]: Finished difference Result 1723 states and 2870 transitions. [2025-03-04 00:34:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:34:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 567 [2025-03-04 00:34:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:37,538 INFO L225 Difference]: With dead ends: 1723 [2025-03-04 00:34:37,538 INFO L226 Difference]: Without dead ends: 1103 [2025-03-04 00:34:37,540 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-04 00:34:37,542 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 270 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:37,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1056 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:34:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-03-04 00:34:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1099. [2025-03-04 00:34:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 944 states have (on average 1.603813559322034) internal successors, (1514), 947 states have internal predecessors, (1514), 150 states have call successors, (150), 4 states have call predecessors, (150), 4 states have return successors, (150), 147 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:34:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1814 transitions. [2025-03-04 00:34:37,601 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1814 transitions. Word has length 567 [2025-03-04 00:34:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:37,602 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1814 transitions. [2025-03-04 00:34:37,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1814 transitions. [2025-03-04 00:34:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:34:37,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:37,632 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:34:37,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1336207012, now seen corresponding path program 1 times [2025-03-04 00:34:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936881773] [2025-03-04 00:34:37,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:37,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:34:37,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:34:37,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:37,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936881773] [2025-03-04 00:34:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936881773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:38,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:34:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574792812] [2025-03-04 00:34:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:34:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:38,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:34:38,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:34:38,179 INFO L87 Difference]: Start difference. First operand 1099 states and 1814 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:38,706 INFO L93 Difference]: Finished difference Result 3209 states and 5313 transitions. [2025-03-04 00:34:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:34:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 568 [2025-03-04 00:34:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:38,716 INFO L225 Difference]: With dead ends: 3209 [2025-03-04 00:34:38,716 INFO L226 Difference]: Without dead ends: 2113 [2025-03-04 00:34:38,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:34:38,720 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 457 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:38,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1700 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:34:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2025-03-04 00:34:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1919. [2025-03-04 00:34:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1677 states have (on average 1.6320810971973763) internal successors, (2737), 1680 states have internal predecessors, (2737), 236 states have call successors, (236), 5 states have call predecessors, (236), 5 states have return successors, (236), 233 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-04 00:34:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 3209 transitions. [2025-03-04 00:34:38,799 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 3209 transitions. Word has length 568 [2025-03-04 00:34:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:38,799 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 3209 transitions. [2025-03-04 00:34:38,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3209 transitions. [2025-03-04 00:34:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:34:38,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:38,804 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:34:38,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:38,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 339134659, now seen corresponding path program 1 times [2025-03-04 00:34:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754681920] [2025-03-04 00:34:38,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:38,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:34:39,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:34:39,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754681920] [2025-03-04 00:34:40,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754681920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:40,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:40,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:34:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495286560] [2025-03-04 00:34:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:40,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:34:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:40,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:34:40,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:34:40,489 INFO L87 Difference]: Start difference. First operand 1919 states and 3209 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:41,128 INFO L93 Difference]: Finished difference Result 5025 states and 8353 transitions. [2025-03-04 00:34:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:34:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 568 [2025-03-04 00:34:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:41,145 INFO L225 Difference]: With dead ends: 5025 [2025-03-04 00:34:41,146 INFO L226 Difference]: Without dead ends: 3725 [2025-03-04 00:34:41,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:34:41,150 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 814 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:41,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1766 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:34:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2025-03-04 00:34:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 2977. [2025-03-04 00:34:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2735 states have (on average 1.6661791590493602) internal successors, (4557), 2738 states have internal predecessors, (4557), 236 states have call successors, (236), 5 states have call predecessors, (236), 5 states have return successors, (236), 233 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-04 00:34:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 5029 transitions. [2025-03-04 00:34:41,266 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 5029 transitions. Word has length 568 [2025-03-04 00:34:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:41,268 INFO L471 AbstractCegarLoop]: Abstraction has 2977 states and 5029 transitions. [2025-03-04 00:34:41,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 5029 transitions. [2025-03-04 00:34:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:34:41,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:41,274 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:41,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:34:41,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:41,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1866173008, now seen corresponding path program 1 times [2025-03-04 00:34:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818176482] [2025-03-04 00:34:41,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:41,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:34:41,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:34:41,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:41,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:42,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:42,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818176482] [2025-03-04 00:34:42,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818176482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:42,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:42,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:34:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749479126] [2025-03-04 00:34:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:42,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:34:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:42,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:34:42,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:34:42,714 INFO L87 Difference]: Start difference. First operand 2977 states and 5029 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:43,078 INFO L93 Difference]: Finished difference Result 6962 states and 11769 transitions. [2025-03-04 00:34:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:34:43,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 568 [2025-03-04 00:34:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:43,096 INFO L225 Difference]: With dead ends: 6962 [2025-03-04 00:34:43,097 INFO L226 Difference]: Without dead ends: 4272 [2025-03-04 00:34:43,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:34:43,103 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 584 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:43,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1126 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:34:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2025-03-04 00:34:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3723. [2025-03-04 00:34:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 3480 states have (on average 1.6586206896551725) internal successors, (5772), 3483 states have internal predecessors, (5772), 236 states have call successors, (236), 6 states have call predecessors, (236), 6 states have return successors, (236), 233 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-04 00:34:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 6244 transitions. [2025-03-04 00:34:43,244 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 6244 transitions. Word has length 568 [2025-03-04 00:34:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 6244 transitions. [2025-03-04 00:34:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 6244 transitions. [2025-03-04 00:34:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:34:43,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:43,254 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:34:43,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -159237454, now seen corresponding path program 1 times [2025-03-04 00:34:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845397883] [2025-03-04 00:34:43,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:43,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:34:43,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:34:43,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:43,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845397883] [2025-03-04 00:34:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845397883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:34:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062701409] [2025-03-04 00:34:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:34:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:44,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:34:44,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:34:44,427 INFO L87 Difference]: Start difference. First operand 3723 states and 6244 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:44,696 INFO L93 Difference]: Finished difference Result 7082 states and 11834 transitions. [2025-03-04 00:34:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:34:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 568 [2025-03-04 00:34:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:44,715 INFO L225 Difference]: With dead ends: 7082 [2025-03-04 00:34:44,716 INFO L226 Difference]: Without dead ends: 4589 [2025-03-04 00:34:44,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:34:44,722 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 516 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:44,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1499 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:34:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2025-03-04 00:34:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 3921. [2025-03-04 00:34:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3678 states have (on average 1.6606851549755302) internal successors, (6108), 3681 states have internal predecessors, (6108), 236 states have call successors, (236), 6 states have call predecessors, (236), 6 states have return successors, (236), 233 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-04 00:34:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6580 transitions. [2025-03-04 00:34:44,834 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6580 transitions. Word has length 568 [2025-03-04 00:34:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:44,835 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6580 transitions. [2025-03-04 00:34:44,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6580 transitions. [2025-03-04 00:34:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:34:44,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:44,841 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:44,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:34:44,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:44,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash -688156493, now seen corresponding path program 1 times [2025-03-04 00:34:44,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:44,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511238924] [2025-03-04 00:34:44,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:44,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:44,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:34:45,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:34:45,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511238924] [2025-03-04 00:34:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511238924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:34:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870511559] [2025-03-04 00:34:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:34:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:45,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:34:45,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:34:45,898 INFO L87 Difference]: Start difference. First operand 3921 states and 6580 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:46,223 INFO L93 Difference]: Finished difference Result 7829 states and 13054 transitions. [2025-03-04 00:34:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:34:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 568 [2025-03-04 00:34:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:46,261 INFO L225 Difference]: With dead ends: 7829 [2025-03-04 00:34:46,261 INFO L226 Difference]: Without dead ends: 5643 [2025-03-04 00:34:46,268 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-04 00:34:46,269 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 324 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:46,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1330 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:34:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2025-03-04 00:34:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5317. [2025-03-04 00:34:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 4985 states have (on average 1.6527582748244734) internal successors, (8239), 4992 states have internal predecessors, (8239), 320 states have call successors, (320), 11 states have call predecessors, (320), 11 states have return successors, (320), 313 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-04 00:34:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8879 transitions. [2025-03-04 00:34:46,450 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8879 transitions. Word has length 568 [2025-03-04 00:34:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:46,451 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 8879 transitions. [2025-03-04 00:34:46,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8879 transitions. [2025-03-04 00:34:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:34:46,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:46,465 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:46,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:34:46,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:46,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1697759739, now seen corresponding path program 1 times [2025-03-04 00:34:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046125120] [2025-03-04 00:34:46,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:46,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:34:46,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:34:46,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:46,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:34:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046125120] [2025-03-04 00:34:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046125120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:34:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550438026] [2025-03-04 00:34:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:34:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:47,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:34:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:34:47,539 INFO L87 Difference]: Start difference. First operand 5317 states and 8879 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:47,980 INFO L93 Difference]: Finished difference Result 10419 states and 17239 transitions. [2025-03-04 00:34:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:34:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 569 [2025-03-04 00:34:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:48,005 INFO L225 Difference]: With dead ends: 10419 [2025-03-04 00:34:48,005 INFO L226 Difference]: Without dead ends: 7081 [2025-03-04 00:34:48,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:34:48,014 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 560 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:48,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1566 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:34:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7081 states. [2025-03-04 00:34:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7081 to 5809. [2025-03-04 00:34:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5809 states, 5477 states have (on average 1.6529121781997445) internal successors, (9053), 5484 states have internal predecessors, (9053), 320 states have call successors, (320), 11 states have call predecessors, (320), 11 states have return successors, (320), 313 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-04 00:34:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 9693 transitions. [2025-03-04 00:34:48,193 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 9693 transitions. Word has length 569 [2025-03-04 00:34:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:48,194 INFO L471 AbstractCegarLoop]: Abstraction has 5809 states and 9693 transitions. [2025-03-04 00:34:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:34:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 9693 transitions. [2025-03-04 00:34:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:34:48,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:48,224 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:48,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:34:48,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:48,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -987639323, now seen corresponding path program 1 times [2025-03-04 00:34:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422699694] [2025-03-04 00:34:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:48,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:34:49,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:34:49,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:49,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 15 proven. 240 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:34:50,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422699694] [2025-03-04 00:34:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422699694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018114294] [2025-03-04 00:34:50,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:50,164 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-04 00:34:50,166 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-04 00:34:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:34:50,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:34:50,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:50,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:34:50,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 8399 proven. 240 refuted. 0 times theorem prover too weak. 5981 trivial. 0 not checked. [2025-03-04 00:34:52,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:34:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 15 proven. 240 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:34:52,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018114294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:34:52,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:34:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-04 00:34:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570310970] [2025-03-04 00:34:52,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:34:52,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:34:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:52,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:34:52,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:34:52,848 INFO L87 Difference]: Start difference. First operand 5809 states and 9693 transitions. Second operand has 15 states, 15 states have (on average 20.066666666666666) internal successors, (301), 15 states have internal predecessors, (301), 10 states have call successors, (246), 4 states have call predecessors, (246), 6 states have return successors, (247), 10 states have call predecessors, (247), 10 states have call successors, (247) [2025-03-04 00:34:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:53,719 INFO L93 Difference]: Finished difference Result 10803 states and 17911 transitions. [2025-03-04 00:34:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:34:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 20.066666666666666) internal successors, (301), 15 states have internal predecessors, (301), 10 states have call successors, (246), 4 states have call predecessors, (246), 6 states have return successors, (247), 10 states have call predecessors, (247), 10 states have call successors, (247) Word has length 569 [2025-03-04 00:34:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:53,742 INFO L225 Difference]: With dead ends: 10803 [2025-03-04 00:34:53,742 INFO L226 Difference]: Without dead ends: 5841 [2025-03-04 00:34:53,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1152 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:34:53,750 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1266 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:53,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 882 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:34:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5841 states. [2025-03-04 00:34:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5841 to 5817. [2025-03-04 00:34:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5817 states, 5463 states have (on average 1.6326194398682043) internal successors, (8919), 5470 states have internal predecessors, (8919), 320 states have call successors, (320), 33 states have call predecessors, (320), 33 states have return successors, (320), 313 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-04 00:34:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5817 states to 5817 states and 9559 transitions. [2025-03-04 00:34:53,896 INFO L78 Accepts]: Start accepts. Automaton has 5817 states and 9559 transitions. Word has length 569 [2025-03-04 00:34:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:53,897 INFO L471 AbstractCegarLoop]: Abstraction has 5817 states and 9559 transitions. [2025-03-04 00:34:53,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.066666666666666) internal successors, (301), 15 states have internal predecessors, (301), 10 states have call successors, (246), 4 states have call predecessors, (246), 6 states have return successors, (247), 10 states have call predecessors, (247), 10 states have call successors, (247) [2025-03-04 00:34:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5817 states and 9559 transitions. [2025-03-04 00:34:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:34:53,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:53,932 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:34:53,942 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-04 00:34:54,133 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,SelfDestructingSolverStorable10 [2025-03-04 00:34:54,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash -25817659, now seen corresponding path program 1 times [2025-03-04 00:34:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905380722] [2025-03-04 00:34:54,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:34:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:34:55,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:55,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 60 proven. 195 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:34:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:56,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905380722] [2025-03-04 00:34:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905380722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:56,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100168618] [2025-03-04 00:34:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:56,170 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-04 00:34:56,172 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-04 00:34:56,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:34:56,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:34:56,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:56,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:34:56,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 6525 proven. 171 refuted. 0 times theorem prover too weak. 7924 trivial. 0 not checked. [2025-03-04 00:34:57,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:34:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 84 proven. 171 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:34:59,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100168618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:34:59,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:34:59,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-04 00:34:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653586832] [2025-03-04 00:34:59,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:34:59,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:34:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:59,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:34:59,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:34:59,036 INFO L87 Difference]: Start difference. First operand 5817 states and 9559 transitions. Second operand has 20 states, 20 states have (on average 18.95) internal successors, (379), 20 states have internal predecessors, (379), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-03-04 00:35:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:02,121 INFO L93 Difference]: Finished difference Result 16304 states and 26458 transitions. [2025-03-04 00:35:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 00:35:02,121 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 18.95) internal successors, (379), 20 states have internal predecessors, (379), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) Word has length 569 [2025-03-04 00:35:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:02,146 INFO L225 Difference]: With dead ends: 16304 [2025-03-04 00:35:02,146 INFO L226 Difference]: Without dead ends: 9403 [2025-03-04 00:35:02,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1129 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=927, Invalid=3495, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 00:35:02,158 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 4284 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 1639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4287 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1639 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:02,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4287 Valid, 3469 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1639 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:35:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9403 states. [2025-03-04 00:35:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9403 to 7435. [2025-03-04 00:35:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 6807 states have (on average 1.5594241222271192) internal successors, (10615), 6821 states have internal predecessors, (10615), 554 states have call successors, (554), 73 states have call predecessors, (554), 73 states have return successors, (554), 540 states have call predecessors, (554), 554 states have call successors, (554) [2025-03-04 00:35:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 11723 transitions. [2025-03-04 00:35:02,438 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 11723 transitions. Word has length 569 [2025-03-04 00:35:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:02,439 INFO L471 AbstractCegarLoop]: Abstraction has 7435 states and 11723 transitions. [2025-03-04 00:35:02,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.95) internal successors, (379), 20 states have internal predecessors, (379), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-03-04 00:35:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 11723 transitions. [2025-03-04 00:35:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:35:02,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:02,447 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:02,457 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-04 00:35:02,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:02,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:02,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash -919490306, now seen corresponding path program 1 times [2025-03-04 00:35:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:02,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163454613] [2025-03-04 00:35:02,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:02,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:35:03,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:35:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 81 proven. 174 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:35:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163454613] [2025-03-04 00:35:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163454613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:35:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282030382] [2025-03-04 00:35:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:03,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:03,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:03,890 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-04 00:35:03,892 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-04 00:35:04,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:35:04,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:35:04,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:04,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:04,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:35:04,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:35:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 5835 proven. 186 refuted. 0 times theorem prover too weak. 8599 trivial. 0 not checked. [2025-03-04 00:35:04,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:35:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 69 proven. 186 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:35:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282030382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:35:05,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:35:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2025-03-04 00:35:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47096681] [2025-03-04 00:35:05,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:35:05,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:35:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:05,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:35:05,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:35:05,233 INFO L87 Difference]: Start difference. First operand 7435 states and 11723 transitions. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 3 states have call successors, (210), 2 states have call predecessors, (210), 4 states have return successors, (212), 3 states have call predecessors, (212), 3 states have call successors, (212) [2025-03-04 00:35:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:05,933 INFO L93 Difference]: Finished difference Result 14391 states and 22644 transitions. [2025-03-04 00:35:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:35:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 3 states have call successors, (210), 2 states have call predecessors, (210), 4 states have return successors, (212), 3 states have call predecessors, (212), 3 states have call successors, (212) Word has length 569 [2025-03-04 00:35:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:05,952 INFO L225 Difference]: With dead ends: 14391 [2025-03-04 00:35:05,953 INFO L226 Difference]: Without dead ends: 7311 [2025-03-04 00:35:05,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1153 GetRequests, 1132 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:35:05,965 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 588 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:05,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1200 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2025-03-04 00:35:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 4759. [2025-03-04 00:35:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4325 states have (on average 1.519306358381503) internal successors, (6571), 4331 states have internal predecessors, (6571), 382 states have call successors, (382), 51 states have call predecessors, (382), 51 states have return successors, (382), 376 states have call predecessors, (382), 382 states have call successors, (382) [2025-03-04 00:35:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 7335 transitions. [2025-03-04 00:35:06,180 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 7335 transitions. Word has length 569 [2025-03-04 00:35:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:06,183 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 7335 transitions. [2025-03-04 00:35:06,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 3 states have call successors, (210), 2 states have call predecessors, (210), 4 states have return successors, (212), 3 states have call predecessors, (212), 3 states have call successors, (212) [2025-03-04 00:35:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 7335 transitions. [2025-03-04 00:35:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:35:06,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:06,190 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:06,200 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-04 00:35:06,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:06,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:06,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1346661519, now seen corresponding path program 1 times [2025-03-04 00:35:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:06,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421039274] [2025-03-04 00:35:06,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:06,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:35:06,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:35:06,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:06,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:35:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421039274] [2025-03-04 00:35:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421039274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:06,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:06,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:35:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997227070] [2025-03-04 00:35:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:06,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:35:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:06,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:35:06,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:35:06,992 INFO L87 Difference]: Start difference. First operand 4759 states and 7335 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:08,406 INFO L93 Difference]: Finished difference Result 11931 states and 18221 transitions. [2025-03-04 00:35:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:35:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 569 [2025-03-04 00:35:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:08,428 INFO L225 Difference]: With dead ends: 11931 [2025-03-04 00:35:08,428 INFO L226 Difference]: Without dead ends: 8611 [2025-03-04 00:35:08,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:08,437 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 849 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:08,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 2089 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:35:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2025-03-04 00:35:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 5159. [2025-03-04 00:35:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5159 states, 4725 states have (on average 1.502010582010582) internal successors, (7097), 4731 states have internal predecessors, (7097), 382 states have call successors, (382), 51 states have call predecessors, (382), 51 states have return successors, (382), 376 states have call predecessors, (382), 382 states have call successors, (382) [2025-03-04 00:35:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 7861 transitions. [2025-03-04 00:35:08,663 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 7861 transitions. Word has length 569 [2025-03-04 00:35:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:08,664 INFO L471 AbstractCegarLoop]: Abstraction has 5159 states and 7861 transitions. [2025-03-04 00:35:08,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 7861 transitions. [2025-03-04 00:35:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:35:08,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:08,670 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:08,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:35:08,670 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 425346519, now seen corresponding path program 1 times [2025-03-04 00:35:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347013045] [2025-03-04 00:35:08,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:08,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:09,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:09,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:09,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 90 proven. 165 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:35:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347013045] [2025-03-04 00:35:10,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347013045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:35:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370438071] [2025-03-04 00:35:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:10,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:10,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:10,181 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-04 00:35:10,182 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-04 00:35:10,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:10,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:10,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:10,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:10,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:35:10,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:35:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 1543 proven. 12 refuted. 0 times theorem prover too weak. 13065 trivial. 0 not checked. [2025-03-04 00:35:10,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:35:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 243 proven. 12 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:35:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370438071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:35:11,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:35:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2025-03-04 00:35:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810927723] [2025-03-04 00:35:11,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:35:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:35:11,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:11,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:35:11,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:35:11,395 INFO L87 Difference]: Start difference. First operand 5159 states and 7861 transitions. Second operand has 18 states, 18 states have (on average 21.61111111111111) internal successors, (389), 18 states have internal predecessors, (389), 6 states have call successors, (258), 3 states have call predecessors, (258), 6 states have return successors, (258), 6 states have call predecessors, (258), 6 states have call successors, (258) [2025-03-04 00:35:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:17,647 INFO L93 Difference]: Finished difference Result 29008 states and 43714 transitions. [2025-03-04 00:35:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 00:35:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 21.61111111111111) internal successors, (389), 18 states have internal predecessors, (389), 6 states have call successors, (258), 3 states have call predecessors, (258), 6 states have return successors, (258), 6 states have call predecessors, (258), 6 states have call successors, (258) Word has length 570 [2025-03-04 00:35:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:17,710 INFO L225 Difference]: With dead ends: 29008 [2025-03-04 00:35:17,711 INFO L226 Difference]: Without dead ends: 24668 [2025-03-04 00:35:17,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1229 GetRequests, 1138 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1670, Invalid=6886, Unknown=0, NotChecked=0, Total=8556 [2025-03-04 00:35:17,729 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 4909 mSDsluCounter, 5685 mSDsCounter, 0 mSdLazyCounter, 5301 mSolverCounterSat, 3108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4909 SdHoareTripleChecker+Valid, 6677 SdHoareTripleChecker+Invalid, 8409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3108 IncrementalHoareTripleChecker+Valid, 5301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:17,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4909 Valid, 6677 Invalid, 8409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3108 Valid, 5301 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 00:35:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24668 states. [2025-03-04 00:35:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24668 to 21751. [2025-03-04 00:35:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21751 states, 19497 states have (on average 1.4609427091347387) internal successors, (28484), 19535 states have internal predecessors, (28484), 1966 states have call successors, (1966), 287 states have call predecessors, (1966), 287 states have return successors, (1966), 1928 states have call predecessors, (1966), 1966 states have call successors, (1966) [2025-03-04 00:35:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21751 states to 21751 states and 32416 transitions. [2025-03-04 00:35:18,978 INFO L78 Accepts]: Start accepts. Automaton has 21751 states and 32416 transitions. Word has length 570 [2025-03-04 00:35:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:18,979 INFO L471 AbstractCegarLoop]: Abstraction has 21751 states and 32416 transitions. [2025-03-04 00:35:18,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.61111111111111) internal successors, (389), 18 states have internal predecessors, (389), 6 states have call successors, (258), 3 states have call predecessors, (258), 6 states have return successors, (258), 6 states have call predecessors, (258), 6 states have call successors, (258) [2025-03-04 00:35:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 21751 states and 32416 transitions. [2025-03-04 00:35:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:35:18,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:18,991 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:19,000 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-04 00:35:19,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:35:19,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:19,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1189910985, now seen corresponding path program 1 times [2025-03-04 00:35:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:19,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182000696] [2025-03-04 00:35:19,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:19,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:20,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:20,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 219 proven. 36 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:35:20,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182000696] [2025-03-04 00:35:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182000696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:35:20,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433250475] [2025-03-04 00:35:20,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:20,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:20,755 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-04 00:35:20,757 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-04 00:35:20,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:21,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:21,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:21,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:21,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:35:21,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:35:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 7213 proven. 147 refuted. 0 times theorem prover too weak. 7260 trivial. 0 not checked. [2025-03-04 00:35:21,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:35:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 108 proven. 147 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-04 00:35:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433250475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:35:21,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:35:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 00:35:21,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535829122] [2025-03-04 00:35:21,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:35:21,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:35:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:21,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:35:21,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:35:21,761 INFO L87 Difference]: Start difference. First operand 21751 states and 32416 transitions. Second operand has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 4 states have call successors, (184), 2 states have call predecessors, (184), 4 states have return successors, (186), 4 states have call predecessors, (186), 4 states have call successors, (186) [2025-03-04 00:35:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:25,129 INFO L93 Difference]: Finished difference Result 65095 states and 96754 transitions. [2025-03-04 00:35:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 00:35:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 4 states have call successors, (184), 2 states have call predecessors, (184), 4 states have return successors, (186), 4 states have call predecessors, (186), 4 states have call successors, (186) Word has length 570 [2025-03-04 00:35:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:25,233 INFO L225 Difference]: With dead ends: 65095 [2025-03-04 00:35:25,234 INFO L226 Difference]: Without dead ends: 43559 [2025-03-04 00:35:25,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1168 GetRequests, 1138 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:35:25,260 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1727 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:25,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 1472 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:35:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43559 states. [2025-03-04 00:35:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43559 to 22543. [2025-03-04 00:35:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22543 states, 20259 states have (on average 1.4489362752356978) internal successors, (29354), 20297 states have internal predecessors, (29354), 1966 states have call successors, (1966), 317 states have call predecessors, (1966), 317 states have return successors, (1966), 1928 states have call predecessors, (1966), 1966 states have call successors, (1966) [2025-03-04 00:35:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22543 states to 22543 states and 33286 transitions. [2025-03-04 00:35:26,662 INFO L78 Accepts]: Start accepts. Automaton has 22543 states and 33286 transitions. Word has length 570 [2025-03-04 00:35:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:26,663 INFO L471 AbstractCegarLoop]: Abstraction has 22543 states and 33286 transitions. [2025-03-04 00:35:26,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 4 states have call successors, (184), 2 states have call predecessors, (184), 4 states have return successors, (186), 4 states have call predecessors, (186), 4 states have call successors, (186) [2025-03-04 00:35:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 22543 states and 33286 transitions. [2025-03-04 00:35:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:35:26,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:26,674 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:26,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:35:26,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 00:35:26,875 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:26,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1409440953, now seen corresponding path program 1 times [2025-03-04 00:35:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059854883] [2025-03-04 00:35:26,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:27,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:27,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:35:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:27,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059854883] [2025-03-04 00:35:27,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059854883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:27,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:27,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:35:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555782550] [2025-03-04 00:35:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:27,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:35:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:27,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:35:27,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:27,345 INFO L87 Difference]: Start difference. First operand 22543 states and 33286 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:29,908 INFO L93 Difference]: Finished difference Result 64635 states and 95850 transitions. [2025-03-04 00:35:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:29,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 570 [2025-03-04 00:35:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:29,986 INFO L225 Difference]: With dead ends: 64635 [2025-03-04 00:35:29,987 INFO L226 Difference]: Without dead ends: 43303 [2025-03-04 00:35:30,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:30,024 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 427 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:30,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1239 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:35:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43303 states. [2025-03-04 00:35:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43303 to 23847. [2025-03-04 00:35:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23847 states, 21563 states have (on average 1.4497982655474655) internal successors, (31262), 21601 states have internal predecessors, (31262), 1966 states have call successors, (1966), 317 states have call predecessors, (1966), 317 states have return successors, (1966), 1928 states have call predecessors, (1966), 1966 states have call successors, (1966) [2025-03-04 00:35:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23847 states to 23847 states and 35194 transitions. [2025-03-04 00:35:31,435 INFO L78 Accepts]: Start accepts. Automaton has 23847 states and 35194 transitions. Word has length 570 [2025-03-04 00:35:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 23847 states and 35194 transitions. [2025-03-04 00:35:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23847 states and 35194 transitions. [2025-03-04 00:35:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:35:31,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:31,447 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:35:31,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash 905623703, now seen corresponding path program 1 times [2025-03-04 00:35:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893986298] [2025-03-04 00:35:31,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:31,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:31,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:31,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:35:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893986298] [2025-03-04 00:35:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893986298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:35:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408541702] [2025-03-04 00:35:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:35:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:32,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:35:32,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:32,577 INFO L87 Difference]: Start difference. First operand 23847 states and 35194 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:35,794 INFO L93 Difference]: Finished difference Result 70315 states and 103877 transitions. [2025-03-04 00:35:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:35:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 570 [2025-03-04 00:35:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:35,896 INFO L225 Difference]: With dead ends: 70315 [2025-03-04 00:35:35,897 INFO L226 Difference]: Without dead ends: 46345 [2025-03-04 00:35:36,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:35:36,078 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1200 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:36,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1386 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46345 states. [2025-03-04 00:35:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46345 to 31123. [2025-03-04 00:35:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31123 states, 28839 states have (on average 1.4660009015569195) internal successors, (42278), 28877 states have internal predecessors, (42278), 1966 states have call successors, (1966), 317 states have call predecessors, (1966), 317 states have return successors, (1966), 1928 states have call predecessors, (1966), 1966 states have call successors, (1966) [2025-03-04 00:35:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31123 states to 31123 states and 46210 transitions. [2025-03-04 00:35:37,526 INFO L78 Accepts]: Start accepts. Automaton has 31123 states and 46210 transitions. Word has length 570 [2025-03-04 00:35:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:37,527 INFO L471 AbstractCegarLoop]: Abstraction has 31123 states and 46210 transitions. [2025-03-04 00:35:37,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 31123 states and 46210 transitions. [2025-03-04 00:35:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:35:37,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:37,541 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:37,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:35:37,541 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1615744119, now seen corresponding path program 1 times [2025-03-04 00:35:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608394043] [2025-03-04 00:35:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:37,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:37,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:35:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608394043] [2025-03-04 00:35:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608394043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:35:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28328641] [2025-03-04 00:35:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:35:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:38,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:35:38,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:35:38,411 INFO L87 Difference]: Start difference. First operand 31123 states and 46210 transitions. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:41,041 INFO L93 Difference]: Finished difference Result 69820 states and 103082 transitions. [2025-03-04 00:35:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:35:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 570 [2025-03-04 00:35:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:41,115 INFO L225 Difference]: With dead ends: 69820 [2025-03-04 00:35:41,115 INFO L226 Difference]: Without dead ends: 38386 [2025-03-04 00:35:41,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:35:41,142 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 698 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:41,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 2464 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:35:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38386 states. [2025-03-04 00:35:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38386 to 25430. [2025-03-04 00:35:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25430 states, 23356 states have (on average 1.4484500770679911) internal successors, (33830), 23384 states have internal predecessors, (33830), 1766 states have call successors, (1766), 307 states have call predecessors, (1766), 307 states have return successors, (1766), 1738 states have call predecessors, (1766), 1766 states have call successors, (1766) [2025-03-04 00:35:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25430 states to 25430 states and 37362 transitions. [2025-03-04 00:35:42,742 INFO L78 Accepts]: Start accepts. Automaton has 25430 states and 37362 transitions. Word has length 570 [2025-03-04 00:35:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:42,743 INFO L471 AbstractCegarLoop]: Abstraction has 25430 states and 37362 transitions. [2025-03-04 00:35:42,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-04 00:35:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 25430 states and 37362 transitions. [2025-03-04 00:35:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:35:42,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:42,753 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:42,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:35:42,754 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:42,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1927763594, now seen corresponding path program 1 times [2025-03-04 00:35:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281200935] [2025-03-04 00:35:42,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:42,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:35:42,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:35:42,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:42,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-04 00:35:43,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281200935] [2025-03-04 00:35:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281200935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:43,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:43,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993733044] [2025-03-04 00:35:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:43,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:43,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:43,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:43,102 INFO L87 Difference]: Start difference. First operand 25430 states and 37362 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86)