./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.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-while_file-34.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 125f40803e1b985402482e09336346a774ad0c00eff4ec5b89ac9ebb2ee5c085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:01:09,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:01:09,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:01:09,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:01:09,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:01:10,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:01:10,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:01:10,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:01:10,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:01:10,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:01:10,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:01:10,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:01:10,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:01:10,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:01:10,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:01:10,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:01:10,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:01:10,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:01:10,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:01:10,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:01:10,011 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 -> 125f40803e1b985402482e09336346a774ad0c00eff4ec5b89ac9ebb2ee5c085 [2025-03-17 04:01:10,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:01:10,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:01:10,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:01:10,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:01:10,229 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:01:10,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i [2025-03-17 04:01:11,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63c6fb05/1c45eb8268ea4af09dfaa9dd8932bac5/FLAG3d3817b78 [2025-03-17 04:01:11,543 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:01:11,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i [2025-03-17 04:01:11,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63c6fb05/1c45eb8268ea4af09dfaa9dd8932bac5/FLAG3d3817b78 [2025-03-17 04:01:11,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63c6fb05/1c45eb8268ea4af09dfaa9dd8932bac5 [2025-03-17 04:01:11,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:01:11,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:01:11,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:01:11,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:01:11,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:01:11,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:01:11" (1/1) ... [2025-03-17 04:01:11,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ed7649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:11, skipping insertion in model container [2025-03-17 04:01:11,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:01:11" (1/1) ... [2025-03-17 04:01:11,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:01:11,976 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-while_file-34.i[915,928] [2025-03-17 04:01:12,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:01:12,030 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:01:12,036 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-while_file-34.i[915,928] [2025-03-17 04:01:12,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:01:12,064 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:01:12,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12 WrapperNode [2025-03-17 04:01:12,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:01:12,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:01:12,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:01:12,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:01:12,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,099 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-17 04:01:12,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:01:12,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:01:12,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:01:12,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:01:12,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,133 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 04:01:12,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:01:12,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:01:12,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:01:12,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:01:12,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (1/1) ... [2025-03-17 04:01:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:01:12,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:01:12,173 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 04:01:12,177 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 04:01:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:01:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:01:12,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:01:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:01:12,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:01:12,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:01:12,245 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:01:12,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:01:12,488 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-17 04:01:12,513 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 04:01:12,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:01:12,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:01:12,534 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:01:12,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:01:12 BoogieIcfgContainer [2025-03-17 04:01:12,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:01:12,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:01:12,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:01:12,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:01:12,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:01:11" (1/3) ... [2025-03-17 04:01:12,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c1851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:01:12, skipping insertion in model container [2025-03-17 04:01:12,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:01:12" (2/3) ... [2025-03-17 04:01:12,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c1851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:01:12, skipping insertion in model container [2025-03-17 04:01:12,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:01:12" (3/3) ... [2025-03-17 04:01:12,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-34.i [2025-03-17 04:01:12,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:01:12,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-34.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:01:12,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:01:12,612 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;@403462d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:01:12,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:01:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 04:01:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 04:01:12,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:12,622 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:12,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:12,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash -877579791, now seen corresponding path program 1 times [2025-03-17 04:01:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065695215] [2025-03-17 04:01:12,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 04:01:12,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 04:01:12,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:12,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 04:01:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:12,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065695215] [2025-03-17 04:01:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065695215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:01:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182810438] [2025-03-17 04:01:12,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:01:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:01:12,819 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 04:01:12,820 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 04:01:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 04:01:12,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 04:01:12,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:12,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:01:12,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:01:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 04:01:12,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:01:12,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182810438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:12,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:01:12,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:01:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178005496] [2025-03-17 04:01:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:01:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:12,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:01:12,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:01:12,967 INFO L87 Difference]: Start difference. First operand has 66 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:01:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:12,988 INFO L93 Difference]: Finished difference Result 129 states and 215 transitions. [2025-03-17 04:01:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:01:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-17 04:01:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:12,994 INFO L225 Difference]: With dead ends: 129 [2025-03-17 04:01:12,994 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 04:01:12,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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 04:01:12,998 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:12,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:01:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 04:01:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 04:01:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 04:01:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2025-03-17 04:01:13,023 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 91 [2025-03-17 04:01:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2025-03-17 04:01:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:01:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2025-03-17 04:01:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 04:01:13,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:13,026 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:13,032 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 04:01:13,228 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 04:01:13,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1206038322, now seen corresponding path program 1 times [2025-03-17 04:01:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292030048] [2025-03-17 04:01:13,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:13,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 04:01:13,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 04:01:13,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:13,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292030048] [2025-03-17 04:01:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292030048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:01:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808368384] [2025-03-17 04:01:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:01:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:01:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:01:13,556 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:13,683 INFO L93 Difference]: Finished difference Result 220 states and 337 transitions. [2025-03-17 04:01:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:01:13,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-17 04:01:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:13,685 INFO L225 Difference]: With dead ends: 220 [2025-03-17 04:01:13,685 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 04:01:13,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:01:13,686 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 126 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:13,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 302 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:01:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 04:01:13,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 127. [2025-03-17 04:01:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:01:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2025-03-17 04:01:13,712 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 91 [2025-03-17 04:01:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:13,712 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2025-03-17 04:01:13,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2025-03-17 04:01:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 04:01:13,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:13,714 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:01:13,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1830948759, now seen corresponding path program 1 times [2025-03-17 04:01:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77141394] [2025-03-17 04:01:13,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:13,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 04:01:13,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 04:01:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:13,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77141394] [2025-03-17 04:01:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77141394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:01:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238718703] [2025-03-17 04:01:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:13,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:01:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:13,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:01:13,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:01:13,911 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:14,085 INFO L93 Difference]: Finished difference Result 374 states and 572 transitions. [2025-03-17 04:01:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:01:14,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-17 04:01:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:14,088 INFO L225 Difference]: With dead ends: 374 [2025-03-17 04:01:14,088 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 04:01:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:01:14,089 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 131 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:14,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 373 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:01:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 04:01:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 131. [2025-03-17 04:01:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:01:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-17 04:01:14,109 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 92 [2025-03-17 04:01:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:14,110 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-17 04:01:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-17 04:01:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:01:14,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:14,111 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:14,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:01:14,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:14,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash -862702033, now seen corresponding path program 1 times [2025-03-17 04:01:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515088141] [2025-03-17 04:01:14,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:14,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:01:14,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:01:14,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:14,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515088141] [2025-03-17 04:01:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515088141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:16,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:01:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755198206] [2025-03-17 04:01:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:01:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:01:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:01:16,051 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:16,510 INFO L93 Difference]: Finished difference Result 421 states and 633 transitions. [2025-03-17 04:01:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:01:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 04:01:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:16,514 INFO L225 Difference]: With dead ends: 421 [2025-03-17 04:01:16,515 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 04:01:16,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:01:16,518 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 168 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:16,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 304 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:01:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 04:01:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2025-03-17 04:01:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:01:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2025-03-17 04:01:16,546 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 93 [2025-03-17 04:01:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:16,547 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2025-03-17 04:01:16,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2025-03-17 04:01:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:01:16,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:16,548 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:16,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:01:16,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:16,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1882690570, now seen corresponding path program 1 times [2025-03-17 04:01:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:16,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690043088] [2025-03-17 04:01:16,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:16,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:01:16,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:01:16,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:16,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690043088] [2025-03-17 04:01:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690043088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 04:01:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775561014] [2025-03-17 04:01:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:23,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 04:01:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:23,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 04:01:23,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:01:23,070 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:25,450 INFO L93 Difference]: Finished difference Result 629 states and 920 transitions. [2025-03-17 04:01:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 04:01:25,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 04:01:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:25,453 INFO L225 Difference]: With dead ends: 629 [2025-03-17 04:01:25,453 INFO L226 Difference]: Without dead ends: 482 [2025-03-17 04:01:25,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-17 04:01:25,456 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 603 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:25,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 567 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:01:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-17 04:01:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 266. [2025-03-17 04:01:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 223 states have (on average 1.4260089686098654) internal successors, (318), 223 states have internal predecessors, (318), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:01:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2025-03-17 04:01:25,488 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 93 [2025-03-17 04:01:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:25,488 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2025-03-17 04:01:25,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2025-03-17 04:01:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:01:25,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:25,490 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:25,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:01:25,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:25,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1524773045, now seen corresponding path program 1 times [2025-03-17 04:01:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330666718] [2025-03-17 04:01:25,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:25,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:01:25,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:01:25,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:25,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330666718] [2025-03-17 04:01:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330666718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:01:26,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722516860] [2025-03-17 04:01:26,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:26,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:01:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:26,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:01:26,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:01:26,699 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:27,492 INFO L93 Difference]: Finished difference Result 623 states and 930 transitions. [2025-03-17 04:01:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:01:27,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 04:01:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:27,496 INFO L225 Difference]: With dead ends: 623 [2025-03-17 04:01:27,497 INFO L226 Difference]: Without dead ends: 477 [2025-03-17 04:01:27,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:01:27,498 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 373 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:27,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 361 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:01:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-17 04:01:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 311. [2025-03-17 04:01:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 268 states have internal predecessors, (377), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:01:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 455 transitions. [2025-03-17 04:01:27,527 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 455 transitions. Word has length 93 [2025-03-17 04:01:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:27,528 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 455 transitions. [2025-03-17 04:01:27,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 455 transitions. [2025-03-17 04:01:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:01:27,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:27,530 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:27,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:01:27,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 75236107, now seen corresponding path program 1 times [2025-03-17 04:01:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:27,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875545140] [2025-03-17 04:01:27,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:27,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:01:27,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:01:27,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:27,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:28,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875545140] [2025-03-17 04:01:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875545140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:01:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097231254] [2025-03-17 04:01:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:01:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:28,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:01:28,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:01:28,675 INFO L87 Difference]: Start difference. First operand 311 states and 455 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:01:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:29,417 INFO L93 Difference]: Finished difference Result 613 states and 895 transitions. [2025-03-17 04:01:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:01:29,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2025-03-17 04:01:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:29,420 INFO L225 Difference]: With dead ends: 613 [2025-03-17 04:01:29,420 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 04:01:29,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:01:29,421 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 308 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:29,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 474 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:01:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 04:01:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 367. [2025-03-17 04:01:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 324 states have (on average 1.441358024691358) internal successors, (467), 324 states have internal predecessors, (467), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:01:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 545 transitions. [2025-03-17 04:01:29,439 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 545 transitions. Word has length 93 [2025-03-17 04:01:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:29,439 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 545 transitions. [2025-03-17 04:01:29,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:01:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 545 transitions. [2025-03-17 04:01:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:01:29,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:29,441 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:29,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:01:29,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:29,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1368260658, now seen corresponding path program 1 times [2025-03-17 04:01:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:29,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023707805] [2025-03-17 04:01:29,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:29,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:01:29,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:01:29,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:29,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023707805] [2025-03-17 04:01:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023707805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:29,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:01:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245281184] [2025-03-17 04:01:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:01:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:29,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:01:29,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:01:29,604 INFO L87 Difference]: Start difference. First operand 367 states and 545 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:29,761 INFO L93 Difference]: Finished difference Result 581 states and 866 transitions. [2025-03-17 04:01:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:01:29,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 04:01:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:29,765 INFO L225 Difference]: With dead ends: 581 [2025-03-17 04:01:29,765 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 04:01:29,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:01:29,766 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:29,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 223 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:01:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 04:01:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 329. [2025-03-17 04:01:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 286 states have (on average 1.402097902097902) internal successors, (401), 286 states have internal predecessors, (401), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:01:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 479 transitions. [2025-03-17 04:01:29,791 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 479 transitions. Word has length 93 [2025-03-17 04:01:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 479 transitions. [2025-03-17 04:01:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2025-03-17 04:01:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 04:01:29,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:29,792 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:29,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:01:29,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash -885469953, now seen corresponding path program 1 times [2025-03-17 04:01:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:29,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573800943] [2025-03-17 04:01:29,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:29,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 04:01:29,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 04:01:29,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:29,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:01:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:01:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:01:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573800943] [2025-03-17 04:01:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573800943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:01:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:01:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 04:01:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629088637] [2025-03-17 04:01:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:01:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 04:01:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:01:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 04:01:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:01:54,616 INFO L87 Difference]: Start difference. First operand 329 states and 479 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:01:56,635 INFO L93 Difference]: Finished difference Result 704 states and 1011 transitions. [2025-03-17 04:01:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 04:01:56,639 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-17 04:01:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:01:56,641 INFO L225 Difference]: With dead ends: 704 [2025-03-17 04:01:56,641 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 04:01:56,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-03-17 04:01:56,642 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 348 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:01:56,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 761 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:01:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 04:01:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 359. [2025-03-17 04:01:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 316 states have (on average 1.3987341772151898) internal successors, (442), 316 states have internal predecessors, (442), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:01:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 520 transitions. [2025-03-17 04:01:56,669 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 520 transitions. Word has length 94 [2025-03-17 04:01:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:01:56,670 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 520 transitions. [2025-03-17 04:01:56,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:01:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 520 transitions. [2025-03-17 04:01:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 04:01:56,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:01:56,672 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:56,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:01:56,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:01:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:01:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1602042880, now seen corresponding path program 1 times [2025-03-17 04:01:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:01:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490279557] [2025-03-17 04:01:56,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:01:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:01:56,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 04:01:56,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 04:01:56,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:01:56,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:02:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:02:21,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:02:21,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490279557] [2025-03-17 04:02:21,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490279557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:02:21,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:02:21,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 04:02:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86791722] [2025-03-17 04:02:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:02:21,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 04:02:21,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:02:21,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 04:02:21,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:02:21,693 INFO L87 Difference]: Start difference. First operand 359 states and 520 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:02:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:02:23,734 INFO L93 Difference]: Finished difference Result 644 states and 910 transitions. [2025-03-17 04:02:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 04:02:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-03-17 04:02:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:02:23,736 INFO L225 Difference]: With dead ends: 644 [2025-03-17 04:02:23,736 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 04:02:23,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2025-03-17 04:02:23,737 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 323 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:02:23,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 857 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:02:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 04:02:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 355. [2025-03-17 04:02:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 312 states have (on average 1.4006410256410255) internal successors, (437), 312 states have internal predecessors, (437), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 04:02:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 515 transitions. [2025-03-17 04:02:23,756 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 515 transitions. Word has length 94 [2025-03-17 04:02:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:02:23,756 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 515 transitions. [2025-03-17 04:02:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:02:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 515 transitions. [2025-03-17 04:02:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 04:02:23,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:02:23,758 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:23,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:02:23,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:02:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:02:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1396004130, now seen corresponding path program 1 times [2025-03-17 04:02:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:02:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395469749] [2025-03-17 04:02:23,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:02:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:02:23,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 04:02:23,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 04:02:23,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:02:23,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat