./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-28.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 affd9b0b1d76ed6c0076d3599bdbad65950dbdf7c49581f4e5a006dd746abe7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:59:35,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:59:35,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:59:35,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:59:35,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:59:35,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:59:35,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:59:35,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:59:35,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:59:35,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:59:35,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:59:35,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:59:35,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:59:35,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:59:35,092 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:59:35,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:59:35,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:59:35,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:59:35,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:59:35,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:59:35,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:59:35,095 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 -> affd9b0b1d76ed6c0076d3599bdbad65950dbdf7c49581f4e5a006dd746abe7e [2025-03-03 21:59:35,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:59:35,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:59:35,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:59:35,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:59:35,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:59:35,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i [2025-03-03 21:59:36,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1030843bb/3ca14deecaae4ad59c28c66aef830eb2/FLAG2b05d5fc1 [2025-03-03 21:59:36,662 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:59:36,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i [2025-03-03 21:59:36,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1030843bb/3ca14deecaae4ad59c28c66aef830eb2/FLAG2b05d5fc1 [2025-03-03 21:59:36,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1030843bb/3ca14deecaae4ad59c28c66aef830eb2 [2025-03-03 21:59:36,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:59:36,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:59:36,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:59:36,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:59:36,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:59:36,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:59:36" (1/1) ... [2025-03-03 21:59:36,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f27629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:36, skipping insertion in model container [2025-03-03 21:59:36,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:59:36" (1/1) ... [2025-03-03 21:59:36,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:59:36,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i[919,932] [2025-03-03 21:59:36,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:59:36,939 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:59:36,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i[919,932] [2025-03-03 21:59:36,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:59:37,002 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:59:37,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37 WrapperNode [2025-03-03 21:59:37,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:59:37,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:59:37,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:59:37,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:59:37,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,056 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-03-03 21:59:37,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:59:37,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:59:37,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:59:37,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:59:37,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:59:37,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:59:37,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:59:37,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:59:37,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:59:37,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (1/1) ... [2025-03-03 21:59:37,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:59:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:59:37,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-03 21:59:37,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:59:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:59:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:59:37,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:59:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:59:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:59:37,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:59:37,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:59:37,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:59:37,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-03 21:59:37,666 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 21:59:37,666 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:59:37,683 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:59:37,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:59:37,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:59:37 BoogieIcfgContainer [2025-03-03 21:59:37,684 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:59:37,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:59:37,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:59:37,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:59:37,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:59:36" (1/3) ... [2025-03-03 21:59:37,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395670cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:59:37, skipping insertion in model container [2025-03-03 21:59:37,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:59:37" (2/3) ... [2025-03-03 21:59:37,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395670cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:59:37, skipping insertion in model container [2025-03-03 21:59:37,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:59:37" (3/3) ... [2025-03-03 21:59:37,692 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i [2025-03-03 21:59:37,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:59:37,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-28.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:59:37,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:59:37,758 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;@552ece8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:59:37,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:59:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:59:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 21:59:37,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:37,771 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:37,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:37,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1995040726, now seen corresponding path program 1 times [2025-03-03 21:59:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913048776] [2025-03-03 21:59:37,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:37,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 21:59:37,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 21:59:37,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:37,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 21:59:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913048776] [2025-03-03 21:59:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913048776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:59:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754759381] [2025-03-03 21:59:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:59:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:59:38,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:59:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:59:38,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 21:59:38,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 21:59:38,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:38,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:59:38,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:59:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 21:59:38,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:59:38,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754759381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:59:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:59:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703312601] [2025-03-03 21:59:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:38,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:59:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:38,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:59:38,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:59:38,307 INFO L87 Difference]: Start difference. First operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 21:59:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:38,342 INFO L93 Difference]: Finished difference Result 200 states and 344 transitions. [2025-03-03 21:59:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:59:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 193 [2025-03-03 21:59:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:38,349 INFO L225 Difference]: With dead ends: 200 [2025-03-03 21:59:38,350 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 21:59:38,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:59:38,358 INFO L435 NwaCegarLoop]: 150 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, 150 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-03 21:59:38,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:59:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 21:59:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-03 21:59:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:59:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2025-03-03 21:59:38,399 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 193 [2025-03-03 21:59:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2025-03-03 21:59:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 21:59:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2025-03-03 21:59:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 21:59:38,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:38,405 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:38,413 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-03 21:59:38,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:59:38,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:38,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1685742663, now seen corresponding path program 1 times [2025-03-03 21:59:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:38,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953946727] [2025-03-03 21:59:38,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:38,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:38,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 21:59:38,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 21:59:38,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:38,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:59:38,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953946727] [2025-03-03 21:59:38,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953946727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:38,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:59:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:59:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513222491] [2025-03-03 21:59:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:38,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:59:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:38,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:59:38,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:38,924 INFO L87 Difference]: Start difference. First operand 100 states and 154 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:38,967 INFO L93 Difference]: Finished difference Result 198 states and 307 transitions. [2025-03-03 21:59:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:59:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2025-03-03 21:59:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:38,970 INFO L225 Difference]: With dead ends: 198 [2025-03-03 21:59:38,970 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 21:59:38,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:38,971 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:59:38,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:59:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 21:59:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-03 21:59:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:59:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2025-03-03 21:59:38,984 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 193 [2025-03-03 21:59:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:38,986 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2025-03-03 21:59:38,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2025-03-03 21:59:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 21:59:38,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:38,991 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:38,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:59:38,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:38,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -440978182, now seen corresponding path program 1 times [2025-03-03 21:59:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248717919] [2025-03-03 21:59:38,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:39,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 21:59:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 21:59:39,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:39,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:59:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248717919] [2025-03-03 21:59:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248717919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:39,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:59:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:59:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327627757] [2025-03-03 21:59:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:39,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:59:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:39,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:59:39,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:39,333 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:39,441 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2025-03-03 21:59:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:59:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2025-03-03 21:59:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:39,444 INFO L225 Difference]: With dead ends: 272 [2025-03-03 21:59:39,445 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 21:59:39,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:39,447 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 62 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:59:39,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 247 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:59:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 21:59:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2025-03-03 21:59:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:59:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 256 transitions. [2025-03-03 21:59:39,472 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 256 transitions. Word has length 193 [2025-03-03 21:59:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:39,472 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 256 transitions. [2025-03-03 21:59:39,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 256 transitions. [2025-03-03 21:59:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 21:59:39,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:39,474 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:59:39,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:39,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1833628938, now seen corresponding path program 1 times [2025-03-03 21:59:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500016331] [2025-03-03 21:59:39,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:39,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 21:59:39,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 21:59:39,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:39,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:59:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500016331] [2025-03-03 21:59:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500016331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:39,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:59:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:59:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460298031] [2025-03-03 21:59:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:39,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:59:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:39,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:59:39,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:59:39,693 INFO L87 Difference]: Start difference. First operand 166 states and 256 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:39,885 INFO L93 Difference]: Finished difference Result 303 states and 471 transitions. [2025-03-03 21:59:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:59:39,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-03-03 21:59:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:39,888 INFO L225 Difference]: With dead ends: 303 [2025-03-03 21:59:39,888 INFO L226 Difference]: Without dead ends: 199 [2025-03-03 21:59:39,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:59:39,888 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 195 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:59:39,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 484 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:59:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-03 21:59:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 168. [2025-03-03 21:59:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:59:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2025-03-03 21:59:39,909 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 194 [2025-03-03 21:59:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:39,910 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2025-03-03 21:59:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2025-03-03 21:59:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 21:59:39,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:39,911 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:59:39,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash 423282069, now seen corresponding path program 1 times [2025-03-03 21:59:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:39,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610730919] [2025-03-03 21:59:39,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:39,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 21:59:39,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 21:59:39,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:39,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:59:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610730919] [2025-03-03 21:59:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610730919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:40,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:59:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:59:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969088493] [2025-03-03 21:59:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:59:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:40,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:59:40,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:59:40,072 INFO L87 Difference]: Start difference. First operand 168 states and 259 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:40,181 INFO L93 Difference]: Finished difference Result 289 states and 448 transitions. [2025-03-03 21:59:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:59:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-03-03 21:59:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:40,183 INFO L225 Difference]: With dead ends: 289 [2025-03-03 21:59:40,183 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 21:59:40,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:59:40,184 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 81 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:59:40,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 510 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:59:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 21:59:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 167. [2025-03-03 21:59:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.330188679245283) internal successors, (141), 106 states have internal predecessors, (141), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:59:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 257 transitions. [2025-03-03 21:59:40,207 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 257 transitions. Word has length 194 [2025-03-03 21:59:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 257 transitions. [2025-03-03 21:59:40,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 257 transitions. [2025-03-03 21:59:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 21:59:40,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:40,211 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:40,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:59:40,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:40,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash -588864457, now seen corresponding path program 1 times [2025-03-03 21:59:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171563468] [2025-03-03 21:59:40,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 21:59:40,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 21:59:40,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:40,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:59:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171563468] [2025-03-03 21:59:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171563468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:59:40,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:59:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95142159] [2025-03-03 21:59:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:40,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:59:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:40,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:59:40,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:40,396 INFO L87 Difference]: Start difference. First operand 167 states and 257 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:40,485 INFO L93 Difference]: Finished difference Result 280 states and 433 transitions. [2025-03-03 21:59:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:59:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-03-03 21:59:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:40,488 INFO L225 Difference]: With dead ends: 280 [2025-03-03 21:59:40,489 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 21:59:40,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:40,490 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:59:40,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 248 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:59:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 21:59:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2025-03-03 21:59:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:59:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2025-03-03 21:59:40,510 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 194 [2025-03-03 21:59:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2025-03-03 21:59:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2025-03-03 21:59:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 21:59:40,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:40,511 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:40,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:59:40,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:40,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2116601063, now seen corresponding path program 1 times [2025-03-03 21:59:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898646834] [2025-03-03 21:59:40,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 21:59:40,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 21:59:40,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:40,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:59:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:59:40,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:59:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898646834] [2025-03-03 21:59:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898646834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:59:40,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:59:40,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:59:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558659319] [2025-03-03 21:59:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:59:40,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:59:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:59:40,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:59:40,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:40,622 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:59:40,668 INFO L93 Difference]: Finished difference Result 271 states and 418 transitions. [2025-03-03 21:59:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:59:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 195 [2025-03-03 21:59:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:59:40,670 INFO L225 Difference]: With dead ends: 271 [2025-03-03 21:59:40,670 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 21:59:40,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:59:40,671 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:59:40,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:59:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 21:59:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2025-03-03 21:59:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:59:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2025-03-03 21:59:40,691 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 252 transitions. Word has length 195 [2025-03-03 21:59:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:59:40,691 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 252 transitions. [2025-03-03 21:59:40,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:59:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 252 transitions. [2025-03-03 21:59:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 21:59:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:59:40,694 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:59:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:59:40,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:59:40,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:59:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash -871836582, now seen corresponding path program 1 times [2025-03-03 21:59:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:59:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874103883] [2025-03-03 21:59:40,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:59:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:59:40,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 21:59:40,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 21:59:40,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:59:40,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat