./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.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 743733c75edc203d6a3698a34f61f0abb7399fbb75a2d96375820580e8166eb4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:55:37,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:55:37,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:55:37,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:55:37,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:55:37,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:55:37,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:55:37,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:55:37,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:55:37,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:55:37,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:55:37,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:55:37,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:55:37,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:55:37,600 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:55:37,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:55:37,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:55:37,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:55:37,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:55:37,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:55:37,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:55:37,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:55:37,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:55:37,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:55:37,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:55:37,603 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 -> 743733c75edc203d6a3698a34f61f0abb7399fbb75a2d96375820580e8166eb4 [2025-03-17 03:55:37,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:55:37,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:55:37,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:55:37,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:55:37,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:55:37,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i [2025-03-17 03:55:39,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155a079c2/98513b2696e14310aa0aefdaee0a189e/FLAGd957f6e84 [2025-03-17 03:55:39,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:55:39,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i [2025-03-17 03:55:39,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155a079c2/98513b2696e14310aa0aefdaee0a189e/FLAGd957f6e84 [2025-03-17 03:55:39,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155a079c2/98513b2696e14310aa0aefdaee0a189e [2025-03-17 03:55:39,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:55:39,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:55:39,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:55:39,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:55:39,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:55:39,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc5c462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39, skipping insertion in model container [2025-03-17 03:55:39,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:55:39,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_loopvsstraightlinecode_50-1loop_file-81.i[915,928] [2025-03-17 03:55:39,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:55:39,461 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:55:39,471 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_loopvsstraightlinecode_50-1loop_file-81.i[915,928] [2025-03-17 03:55:39,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:55:39,502 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:55:39,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39 WrapperNode [2025-03-17 03:55:39,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:55:39,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:55:39,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:55:39,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:55:39,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,543 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2025-03-17 03:55:39,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:55:39,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:55:39,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:55:39,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:55:39,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:55:39,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:55:39,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:55:39,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:55:39,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:55:39,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (1/1) ... [2025-03-17 03:55:39,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:55:39,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:55:39,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:55:39,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:55:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:55:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:55:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:55:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:55:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:55:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:55:39,682 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:55:39,683 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:55:39,983 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-17 03:55:40,022 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:55:40,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:55:40,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:55:40,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:55:40,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:55:40 BoogieIcfgContainer [2025-03-17 03:55:40,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:55:40,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:55:40,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:55:40,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:55:40,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:55:39" (1/3) ... [2025-03-17 03:55:40,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1199a4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:55:40, skipping insertion in model container [2025-03-17 03:55:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:55:39" (2/3) ... [2025-03-17 03:55:40,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1199a4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:55:40, skipping insertion in model container [2025-03-17 03:55:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:55:40" (3/3) ... [2025-03-17 03:55:40,048 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-81.i [2025-03-17 03:55:40,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:55:40,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-81.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:55:40,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:55:40,103 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;@7c67b494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:55:40,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:55:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:55:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:55:40,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:55:40,117 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:55:40,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:55:40,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:55:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1882983992, now seen corresponding path program 1 times [2025-03-17 03:55:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:55:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860461498] [2025-03-17 03:55:40,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:55:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:55:40,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:55:40,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:55:40,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:55:40,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:55:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 03:55:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:55:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860461498] [2025-03-17 03:55:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860461498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:55:40,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343901531] [2025-03-17 03:55:40,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:55:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:55:40,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:55:40,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:55:40,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:55:40,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:55:40,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:55:40,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:55:40,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:55:40,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:55:40,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:55:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 03:55:40,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:55:40,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343901531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:55:40,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:55:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:55:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213381793] [2025-03-17 03:55:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:55:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:55:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:55:40,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:55:40,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:55:40,618 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:55:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:55:40,645 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2025-03-17 03:55:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:55:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2025-03-17 03:55:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:55:40,651 INFO L225 Difference]: With dead ends: 143 [2025-03-17 03:55:40,651 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 03:55:40,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:55:40,654 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:55:40,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:55:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 03:55:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 03:55:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:55:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2025-03-17 03:55:40,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 160 [2025-03-17 03:55:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:55:40,680 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2025-03-17 03:55:40,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:55:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2025-03-17 03:55:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:55:40,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:55:40,682 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:55:40,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:55:40,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:55:40,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:55:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:55:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2019961128, now seen corresponding path program 1 times [2025-03-17 03:55:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:55:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749286423] [2025-03-17 03:55:40,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:55:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:55:40,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:55:41,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:55:41,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:55:41,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:55:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:55:41,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:55:41,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749286423] [2025-03-17 03:55:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749286423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:55:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:55:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:55:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893049552] [2025-03-17 03:55:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:55:41,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:55:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:55:41,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:55:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:55:41,430 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:55:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:55:41,557 INFO L93 Difference]: Finished difference Result 173 states and 263 transitions. [2025-03-17 03:55:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:55:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-17 03:55:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:55:41,560 INFO L225 Difference]: With dead ends: 173 [2025-03-17 03:55:41,560 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 03:55:41,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:55:41,561 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 41 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:55:41,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 307 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:55:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 03:55:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-03-17 03:55:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 03:55:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2025-03-17 03:55:41,582 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 160 [2025-03-17 03:55:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:55:41,584 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2025-03-17 03:55:41,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:55:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2025-03-17 03:55:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:55:41,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:55:41,588 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:55:41,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:55:41,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:55:41,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:55:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1823447623, now seen corresponding path program 1 times [2025-03-17 03:55:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:55:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730859694] [2025-03-17 03:55:41,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:55:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:55:41,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:55:41,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:55:41,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:55:41,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:55:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:55:49,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:55:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730859694] [2025-03-17 03:55:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730859694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:55:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:55:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:55:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96374849] [2025-03-17 03:55:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:55:49,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:55:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:55:49,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:55:49,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:55:49,141 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:55:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:55:51,689 INFO L93 Difference]: Finished difference Result 376 states and 553 transitions. [2025-03-17 03:55:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:55:51,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-17 03:55:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:55:51,694 INFO L225 Difference]: With dead ends: 376 [2025-03-17 03:55:51,694 INFO L226 Difference]: Without dead ends: 276 [2025-03-17 03:55:51,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:55:51,697 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 522 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:55:51,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 497 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:55:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-17 03:55:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 159. [2025-03-17 03:55:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 100 states have internal predecessors, (130), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:55:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 242 transitions. [2025-03-17 03:55:51,736 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 242 transitions. Word has length 160 [2025-03-17 03:55:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:55:51,737 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 242 transitions. [2025-03-17 03:55:51,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:55:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 242 transitions. [2025-03-17 03:55:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:55:51,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:55:51,740 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:55:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:55:51,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:55:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:55:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 674568314, now seen corresponding path program 1 times [2025-03-17 03:55:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:55:51,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093204508] [2025-03-17 03:55:51,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:55:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:55:51,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:55:51,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:55:51,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:55:51,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:55:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:55:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:55:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093204508] [2025-03-17 03:55:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093204508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:55:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:55:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:55:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029996957] [2025-03-17 03:55:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:55:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:55:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:55:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:55:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:55:58,708 INFO L87 Difference]: Start difference. First operand 159 states and 242 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:01,221 INFO L93 Difference]: Finished difference Result 365 states and 539 transitions. [2025-03-17 03:56:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:56:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-17 03:56:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:01,226 INFO L225 Difference]: With dead ends: 365 [2025-03-17 03:56:01,227 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 03:56:01,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:56:01,229 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 397 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:01,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 506 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:56:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 03:56:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 159. [2025-03-17 03:56:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 100 states have internal predecessors, (130), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 242 transitions. [2025-03-17 03:56:01,256 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 242 transitions. Word has length 160 [2025-03-17 03:56:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:01,257 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 242 transitions. [2025-03-17 03:56:01,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 242 transitions. [2025-03-17 03:56:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:56:01,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:01,260 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:01,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:56:01,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1694364904, now seen corresponding path program 1 times [2025-03-17 03:56:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:01,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023593765] [2025-03-17 03:56:01,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:01,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:56:01,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:56:01,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:01,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:01,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023593765] [2025-03-17 03:56:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023593765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:56:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41284768] [2025-03-17 03:56:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:56:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:01,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:56:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:56:01,673 INFO L87 Difference]: Start difference. First operand 159 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:02,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:02,006 INFO L93 Difference]: Finished difference Result 305 states and 460 transitions. [2025-03-17 03:56:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:56:02,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-17 03:56:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:02,009 INFO L225 Difference]: With dead ends: 305 [2025-03-17 03:56:02,010 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 03:56:02,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:56:02,011 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 98 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:02,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 415 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:56:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 03:56:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 165. [2025-03-17 03:56:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 106 states have internal predecessors, (137), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2025-03-17 03:56:02,035 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 160 [2025-03-17 03:56:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:02,036 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2025-03-17 03:56:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2025-03-17 03:56:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:56:02,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:02,037 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:56:02,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1965961048, now seen corresponding path program 1 times [2025-03-17 03:56:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:02,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633329088] [2025-03-17 03:56:02,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:02,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:56:02,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:56:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633329088] [2025-03-17 03:56:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633329088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:56:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140569043] [2025-03-17 03:56:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:56:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:07,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:56:07,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:56:07,523 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:08,703 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2025-03-17 03:56:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:56:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-17 03:56:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:08,706 INFO L225 Difference]: With dead ends: 334 [2025-03-17 03:56:08,706 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 03:56:08,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:56:08,707 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 207 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:08,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 394 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:56:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 03:56:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 166. [2025-03-17 03:56:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 107 states have internal predecessors, (139), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2025-03-17 03:56:08,722 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 160 [2025-03-17 03:56:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:08,722 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2025-03-17 03:56:08,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2025-03-17 03:56:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 03:56:08,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:08,724 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:08,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:56:08,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:08,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash 169009689, now seen corresponding path program 1 times [2025-03-17 03:56:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505137754] [2025-03-17 03:56:08,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:08,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 03:56:08,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 03:56:08,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:15,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505137754] [2025-03-17 03:56:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505137754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:15,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:56:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160383537] [2025-03-17 03:56:15,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:15,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:56:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:15,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:56:15,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:56:15,667 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:16,376 INFO L93 Difference]: Finished difference Result 344 states and 510 transitions. [2025-03-17 03:56:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:56:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-17 03:56:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:16,378 INFO L225 Difference]: With dead ends: 344 [2025-03-17 03:56:16,378 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 03:56:16,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:56:16,379 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 154 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:16,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 409 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:56:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 03:56:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 164. [2025-03-17 03:56:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2025-03-17 03:56:16,397 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 160 [2025-03-17 03:56:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:16,398 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2025-03-17 03:56:16,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2025-03-17 03:56:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:16,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:16,400 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:16,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:56:16,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:16,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1176359790, now seen corresponding path program 1 times [2025-03-17 03:56:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63133481] [2025-03-17 03:56:16,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:16,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:16,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:20,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63133481] [2025-03-17 03:56:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63133481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:56:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584372997] [2025-03-17 03:56:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:20,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:56:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:20,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:56:20,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:56:20,084 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:21,294 INFO L93 Difference]: Finished difference Result 401 states and 591 transitions. [2025-03-17 03:56:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:56:21,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:21,297 INFO L225 Difference]: With dead ends: 401 [2025-03-17 03:56:21,297 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 03:56:21,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:56:21,298 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 311 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:21,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 495 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:56:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 03:56:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2025-03-17 03:56:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 118 states have internal predecessors, (156), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 268 transitions. [2025-03-17 03:56:21,312 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 268 transitions. Word has length 161 [2025-03-17 03:56:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:21,312 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 268 transitions. [2025-03-17 03:56:21,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 268 transitions. [2025-03-17 03:56:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:21,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:21,313 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:21,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:56:21,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash -979846285, now seen corresponding path program 1 times [2025-03-17 03:56:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:21,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975529181] [2025-03-17 03:56:21,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:21,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:21,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:21,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:21,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975529181] [2025-03-17 03:56:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975529181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:24,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:24,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:56:24,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709986447] [2025-03-17 03:56:24,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:24,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:56:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:24,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:56:24,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:56:24,345 INFO L87 Difference]: Start difference. First operand 177 states and 268 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:25,406 INFO L93 Difference]: Finished difference Result 471 states and 686 transitions. [2025-03-17 03:56:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:56:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:25,409 INFO L225 Difference]: With dead ends: 471 [2025-03-17 03:56:25,409 INFO L226 Difference]: Without dead ends: 361 [2025-03-17 03:56:25,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:56:25,410 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 424 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:25,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 545 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:56:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-17 03:56:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 181. [2025-03-17 03:56:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 122 states have internal predecessors, (162), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2025-03-17 03:56:25,424 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 161 [2025-03-17 03:56:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:25,424 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2025-03-17 03:56:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2025-03-17 03:56:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:25,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:25,425 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:25,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:56:25,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1321656147, now seen corresponding path program 1 times [2025-03-17 03:56:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166281630] [2025-03-17 03:56:25,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:25,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:25,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:25,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:25,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:29,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:29,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166281630] [2025-03-17 03:56:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166281630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:56:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083672658] [2025-03-17 03:56:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:29,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:56:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:56:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:56:29,040 INFO L87 Difference]: Start difference. First operand 181 states and 274 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:56:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:30,370 INFO L93 Difference]: Finished difference Result 430 states and 632 transitions. [2025-03-17 03:56:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:56:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2025-03-17 03:56:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:30,372 INFO L225 Difference]: With dead ends: 430 [2025-03-17 03:56:30,372 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 03:56:30,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:56:30,373 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 343 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:30,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 587 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:56:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 03:56:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 181. [2025-03-17 03:56:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 122 states have internal predecessors, (162), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2025-03-17 03:56:30,391 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 161 [2025-03-17 03:56:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:30,392 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2025-03-17 03:56:30,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:56:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2025-03-17 03:56:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:30,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:30,393 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:30,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:56:30,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:30,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169652, now seen corresponding path program 1 times [2025-03-17 03:56:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:30,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586025235] [2025-03-17 03:56:30,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:30,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:30,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:30,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586025235] [2025-03-17 03:56:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586025235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:56:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654396945] [2025-03-17 03:56:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:56:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:35,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:56:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:56:35,305 INFO L87 Difference]: Start difference. First operand 181 states and 274 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:35,723 INFO L93 Difference]: Finished difference Result 384 states and 569 transitions. [2025-03-17 03:56:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:56:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:35,727 INFO L225 Difference]: With dead ends: 384 [2025-03-17 03:56:35,727 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 03:56:35,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:56:35,728 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 167 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:35,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 339 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:56:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 03:56:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 184. [2025-03-17 03:56:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 124 states have (on average 1.346774193548387) internal successors, (167), 125 states have internal predecessors, (167), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 279 transitions. [2025-03-17 03:56:35,752 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 279 transitions. Word has length 161 [2025-03-17 03:56:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:35,753 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 279 transitions. [2025-03-17 03:56:35,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 279 transitions. [2025-03-17 03:56:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:35,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:35,754 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:35,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:56:35,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 816097522, now seen corresponding path program 1 times [2025-03-17 03:56:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:35,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312808403] [2025-03-17 03:56:35,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:35,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:35,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:36,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:36,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312808403] [2025-03-17 03:56:36,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312808403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:36,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:36,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:56:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617668671] [2025-03-17 03:56:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:36,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:56:36,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:36,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:56:36,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:56:36,267 INFO L87 Difference]: Start difference. First operand 184 states and 279 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:36,658 INFO L93 Difference]: Finished difference Result 377 states and 560 transitions. [2025-03-17 03:56:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:56:36,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:36,660 INFO L225 Difference]: With dead ends: 377 [2025-03-17 03:56:36,660 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 03:56:36,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:56:36,661 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 216 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:36,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 383 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:56:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 03:56:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 181. [2025-03-17 03:56:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 122 states have internal predecessors, (163), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 275 transitions. [2025-03-17 03:56:36,678 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 275 transitions. Word has length 161 [2025-03-17 03:56:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:36,679 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 275 transitions. [2025-03-17 03:56:36,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 275 transitions. [2025-03-17 03:56:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:36,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:36,681 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:36,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:56:36,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:36,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:36,682 INFO L85 PathProgramCache]: Analyzing trace with hash 331192019, now seen corresponding path program 1 times [2025-03-17 03:56:36,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:36,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862341774] [2025-03-17 03:56:36,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:36,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:36,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:36,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:36,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862341774] [2025-03-17 03:56:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862341774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:41,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:56:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127537971] [2025-03-17 03:56:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:41,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:56:41,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:41,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:56:41,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:56:41,132 INFO L87 Difference]: Start difference. First operand 181 states and 275 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:42,013 INFO L93 Difference]: Finished difference Result 411 states and 610 transitions. [2025-03-17 03:56:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:56:42,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:42,016 INFO L225 Difference]: With dead ends: 411 [2025-03-17 03:56:42,016 INFO L226 Difference]: Without dead ends: 296 [2025-03-17 03:56:42,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:56:42,017 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 199 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:42,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 493 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:56:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-17 03:56:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 183. [2025-03-17 03:56:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 124 states have internal predecessors, (167), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:56:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 279 transitions. [2025-03-17 03:56:42,031 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 279 transitions. Word has length 161 [2025-03-17 03:56:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:42,031 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 279 transitions. [2025-03-17 03:56:42,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 279 transitions. [2025-03-17 03:56:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:42,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:42,032 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:42,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:56:42,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:42,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash 527705524, now seen corresponding path program 1 times [2025-03-17 03:56:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732066586] [2025-03-17 03:56:42,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:42,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:42,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:42,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:42,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732066586] [2025-03-17 03:56:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732066586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:56:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216715486] [2025-03-17 03:56:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:42,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:56:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:42,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:56:42,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:56:42,152 INFO L87 Difference]: Start difference. First operand 183 states and 279 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:42,210 INFO L93 Difference]: Finished difference Result 339 states and 505 transitions. [2025-03-17 03:56:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:56:42,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:42,212 INFO L225 Difference]: With dead ends: 339 [2025-03-17 03:56:42,212 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 03:56:42,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:56:42,213 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 58 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:42,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 309 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:56:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 03:56:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2025-03-17 03:56:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 03:56:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2025-03-17 03:56:42,226 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 161 [2025-03-17 03:56:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:42,226 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2025-03-17 03:56:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2025-03-17 03:56:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 03:56:42,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:42,227 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:56:42,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1465759340, now seen corresponding path program 1 times [2025-03-17 03:56:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118620477] [2025-03-17 03:56:42,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:42,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 03:56:42,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 03:56:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:56:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:56:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:56:47,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118620477] [2025-03-17 03:56:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118620477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:56:47,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:56:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:56:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653003251] [2025-03-17 03:56:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:56:47,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:56:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:56:47,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:56:47,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:56:47,581 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:56:48,598 INFO L93 Difference]: Finished difference Result 337 states and 497 transitions. [2025-03-17 03:56:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:56:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-03-17 03:56:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:56:48,600 INFO L225 Difference]: With dead ends: 337 [2025-03-17 03:56:48,600 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 03:56:48,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:56:48,601 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 135 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:56:48,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 490 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:56:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 03:56:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 172. [2025-03-17 03:56:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 03:56:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 259 transitions. [2025-03-17 03:56:48,613 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 259 transitions. Word has length 161 [2025-03-17 03:56:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:56:48,613 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 259 transitions. [2025-03-17 03:56:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:56:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 259 transitions. [2025-03-17 03:56:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 03:56:48,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:56:48,614 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:56:48,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:56:48,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:56:48,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:56:48,615 INFO L85 PathProgramCache]: Analyzing trace with hash -812908265, now seen corresponding path program 1 times [2025-03-17 03:56:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:56:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982691353] [2025-03-17 03:56:48,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:56:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:56:48,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 03:56:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 03:56:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:56:48,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat