./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-52.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-pe-co_file-52.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 f0fa134855523ba41b09db07b615548474e6d0ee22f6659fed051b05fa2d243f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:53:22,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:53:23,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:53:23,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:53:23,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:53:23,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:53:23,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:53:23,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:53:23,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:53:23,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:53:23,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:53:23,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:53:23,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:53:23,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:53:23,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:53:23,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:53:23,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:53:23,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:53:23,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:53:23,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:53:23,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:53:23,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:53:23,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:53:23,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:53:23,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:53:23,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:53:23,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:53:23,070 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 -> f0fa134855523ba41b09db07b615548474e6d0ee22f6659fed051b05fa2d243f [2025-03-03 20:53:23,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:53:23,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:53:23,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:53:23,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:53:23,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:53:23,332 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-pe-co_file-52.i [2025-03-03 20:53:24,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6651a2848/f507a0c0c4c5425682c987f21b2e2a9b/FLAG678259a69 [2025-03-03 20:53:24,786 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:53:24,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-52.i [2025-03-03 20:53:24,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6651a2848/f507a0c0c4c5425682c987f21b2e2a9b/FLAG678259a69 [2025-03-03 20:53:25,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6651a2848/f507a0c0c4c5425682c987f21b2e2a9b [2025-03-03 20:53:25,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:53:25,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:53:25,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:53:25,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:53:25,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:53:25,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25, skipping insertion in model container [2025-03-03 20:53:25,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:53:25,233 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-pe-co_file-52.i[919,932] [2025-03-03 20:53:25,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:53:25,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:53:25,303 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-pe-co_file-52.i[919,932] [2025-03-03 20:53:25,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:53:25,343 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:53:25,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25 WrapperNode [2025-03-03 20:53:25,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:53:25,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:53:25,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:53:25,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:53:25,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,378 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-03-03 20:53:25,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:53:25,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:53:25,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:53:25,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:53:25,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,403 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:53:25,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:53:25,429 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:53:25,429 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:53:25,429 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:53:25,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (1/1) ... [2025-03-03 20:53:25,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:53:25,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:53:25,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:53:25,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:53:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:53:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:53:25,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:53:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:53:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:53:25,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:53:25,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:53:25,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:53:25,840 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 20:53:25,840 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:53:25,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:53:25,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:53:25,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:53:25 BoogieIcfgContainer [2025-03-03 20:53:25,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:53:25,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:53:25,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:53:25,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:53:25,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:53:25" (1/3) ... [2025-03-03 20:53:25,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627b5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:53:25, skipping insertion in model container [2025-03-03 20:53:25,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:53:25" (2/3) ... [2025-03-03 20:53:25,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627b5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:53:25, skipping insertion in model container [2025-03-03 20:53:25,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:53:25" (3/3) ... [2025-03-03 20:53:25,864 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-52.i [2025-03-03 20:53:25,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:53:25,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-52.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:53:25,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:53:25,931 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;@6bc1d0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:53:25,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:53:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:53:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:53:25,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:25,947 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:25,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:25,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1908850953, now seen corresponding path program 1 times [2025-03-03 20:53:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:25,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-03-03 20:53:25,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:26,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:53:26,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:53:26,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:26,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 20:53:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-03-03 20:53:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263028662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:53:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969988712] [2025-03-03 20:53:26,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:53:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:53:26,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:53:26,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:53:26,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:53:26,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:53:26,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:26,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:53:26,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:53:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 20:53:26,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:53:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969988712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:53:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:53:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088201639] [2025-03-03 20:53:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:53:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:26,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:53:26,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:53:26,432 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:53:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:26,460 INFO L93 Difference]: Finished difference Result 166 states and 283 transitions. [2025-03-03 20:53:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:53:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2025-03-03 20:53:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:26,467 INFO L225 Difference]: With dead ends: 166 [2025-03-03 20:53:26,467 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 20:53:26,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:53:26,472 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:26,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:53:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 20:53:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 20:53:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:53:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2025-03-03 20:53:26,506 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 152 [2025-03-03 20:53:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:26,507 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2025-03-03 20:53:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:53:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2025-03-03 20:53:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:53:26,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:26,509 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:26,516 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 20:53:26,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:53:26,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:26,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -40948389, now seen corresponding path program 1 times [2025-03-03 20:53:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948568760] [2025-03-03 20:53:26,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:26,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:53:26,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:53:26,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:27,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948568760] [2025-03-03 20:53:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948568760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:27,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:53:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117368501] [2025-03-03 20:53:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:53:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:27,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:53:27,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:53:27,087 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:27,296 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2025-03-03 20:53:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:53:27,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 20:53:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:27,300 INFO L225 Difference]: With dead ends: 284 [2025-03-03 20:53:27,300 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 20:53:27,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 20:53:27,302 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 216 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:27,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 562 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:53:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 20:53:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 159. [2025-03-03 20:53:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 112 states have internal predecessors, (158), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 20:53:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2025-03-03 20:53:27,328 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 152 [2025-03-03 20:53:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:27,328 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2025-03-03 20:53:27,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2025-03-03 20:53:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:53:27,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:27,333 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:27,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:53:27,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:27,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2079004678, now seen corresponding path program 1 times [2025-03-03 20:53:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029340305] [2025-03-03 20:53:27,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:27,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:53:27,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:53:27,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:27,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029340305] [2025-03-03 20:53:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029340305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:53:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904687707] [2025-03-03 20:53:27,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:53:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:27,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:53:27,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:27,434 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:27,470 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2025-03-03 20:53:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:53:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 20:53:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:27,474 INFO L225 Difference]: With dead ends: 395 [2025-03-03 20:53:27,476 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 20:53:27,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:27,480 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 70 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:27,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 283 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:53:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 20:53:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2025-03-03 20:53:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 166 states have (on average 1.4156626506024097) internal successors, (235), 166 states have internal predecessors, (235), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 20:53:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 367 transitions. [2025-03-03 20:53:27,519 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 367 transitions. Word has length 152 [2025-03-03 20:53:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:27,520 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 367 transitions. [2025-03-03 20:53:27,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 367 transitions. [2025-03-03 20:53:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:53:27,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:27,524 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:27,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:53:27,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:27,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1422670810, now seen corresponding path program 1 times [2025-03-03 20:53:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352171021] [2025-03-03 20:53:27,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:27,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:53:27,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:53:27,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:27,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352171021] [2025-03-03 20:53:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352171021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:53:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030936396] [2025-03-03 20:53:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:27,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:53:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:27,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:53:27,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:27,784 INFO L87 Difference]: Start difference. First operand 236 states and 367 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:27,842 INFO L93 Difference]: Finished difference Result 702 states and 1095 transitions. [2025-03-03 20:53:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:53:27,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 20:53:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:27,849 INFO L225 Difference]: With dead ends: 702 [2025-03-03 20:53:27,849 INFO L226 Difference]: Without dead ends: 469 [2025-03-03 20:53:27,851 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 20:53:27,852 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 75 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:27,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 263 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:53:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-03 20:53:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2025-03-03 20:53:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 328 states have (on average 1.4115853658536586) internal successors, (463), 328 states have internal predecessors, (463), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:53:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 727 transitions. [2025-03-03 20:53:27,912 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 727 transitions. Word has length 152 [2025-03-03 20:53:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:27,912 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 727 transitions. [2025-03-03 20:53:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 727 transitions. [2025-03-03 20:53:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 20:53:27,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:27,914 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:53:27,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:27,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1184933452, now seen corresponding path program 1 times [2025-03-03 20:53:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372436143] [2025-03-03 20:53:27,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:27,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 20:53:28,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 20:53:28,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:28,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372436143] [2025-03-03 20:53:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372436143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:53:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34255570] [2025-03-03 20:53:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:28,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:53:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:28,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:53:28,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:53:28,686 INFO L87 Difference]: Start difference. First operand 467 states and 727 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:29,038 INFO L93 Difference]: Finished difference Result 994 states and 1548 transitions. [2025-03-03 20:53:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:53:29,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 20:53:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:29,043 INFO L225 Difference]: With dead ends: 994 [2025-03-03 20:53:29,043 INFO L226 Difference]: Without dead ends: 530 [2025-03-03 20:53:29,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:53:29,045 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 122 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:29,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 478 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:53:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-03 20:53:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 473. [2025-03-03 20:53:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 334 states have (on average 1.3952095808383234) internal successors, (466), 334 states have internal predecessors, (466), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 20:53:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 730 transitions. [2025-03-03 20:53:29,088 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 730 transitions. Word has length 153 [2025-03-03 20:53:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:29,089 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 730 transitions. [2025-03-03 20:53:29,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 730 transitions. [2025-03-03 20:53:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 20:53:29,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:29,092 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:29,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:53:29,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:29,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1055850733, now seen corresponding path program 1 times [2025-03-03 20:53:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614785298] [2025-03-03 20:53:29,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:29,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 20:53:29,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 20:53:29,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:29,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614785298] [2025-03-03 20:53:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614785298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:53:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300003371] [2025-03-03 20:53:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:53:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:33,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:53:33,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:53:33,826 INFO L87 Difference]: Start difference. First operand 473 states and 730 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:53:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:34,555 INFO L93 Difference]: Finished difference Result 1206 states and 1851 transitions. [2025-03-03 20:53:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:53:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 153 [2025-03-03 20:53:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:34,562 INFO L225 Difference]: With dead ends: 1206 [2025-03-03 20:53:34,562 INFO L226 Difference]: Without dead ends: 892 [2025-03-03 20:53:34,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:53:34,564 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 409 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:34,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 691 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:53:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-03-03 20:53:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 545. [2025-03-03 20:53:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 383 states have (on average 1.3838120104438643) internal successors, (530), 383 states have internal predecessors, (530), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 20:53:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 838 transitions. [2025-03-03 20:53:34,616 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 838 transitions. Word has length 153 [2025-03-03 20:53:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:34,617 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 838 transitions. [2025-03-03 20:53:34,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:53:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 838 transitions. [2025-03-03 20:53:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 20:53:34,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:34,619 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:53:34,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:34,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1361989298, now seen corresponding path program 1 times [2025-03-03 20:53:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931053858] [2025-03-03 20:53:34,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:34,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 20:53:34,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 20:53:34,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:34,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931053858] [2025-03-03 20:53:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931053858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:53:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214203389] [2025-03-03 20:53:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:34,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:53:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:34,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:53:34,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:53:34,717 INFO L87 Difference]: Start difference. First operand 545 states and 838 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:34,848 INFO L93 Difference]: Finished difference Result 1023 states and 1576 transitions. [2025-03-03 20:53:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:53:34,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 20:53:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:34,854 INFO L225 Difference]: With dead ends: 1023 [2025-03-03 20:53:34,854 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 20:53:34,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:53:34,856 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 225 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:34,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 474 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:53:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 20:53:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 583. [2025-03-03 20:53:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 421 states have (on average 1.3895486935866983) internal successors, (585), 421 states have internal predecessors, (585), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 20:53:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 893 transitions. [2025-03-03 20:53:34,901 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 893 transitions. Word has length 153 [2025-03-03 20:53:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:34,901 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 893 transitions. [2025-03-03 20:53:34,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 893 transitions. [2025-03-03 20:53:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 20:53:34,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:34,903 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:34,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:53:34,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:34,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1024830926, now seen corresponding path program 1 times [2025-03-03 20:53:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459199538] [2025-03-03 20:53:34,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:34,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 20:53:34,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 20:53:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:35,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459199538] [2025-03-03 20:53:35,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459199538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:53:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468679293] [2025-03-03 20:53:35,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:35,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:53:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:35,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:53:35,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:53:35,010 INFO L87 Difference]: Start difference. First operand 583 states and 893 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:35,164 INFO L93 Difference]: Finished difference Result 1091 states and 1676 transitions. [2025-03-03 20:53:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:53:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 20:53:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:35,169 INFO L225 Difference]: With dead ends: 1091 [2025-03-03 20:53:35,169 INFO L226 Difference]: Without dead ends: 583 [2025-03-03 20:53:35,173 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-03 20:53:35,174 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 146 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:35,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 184 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:53:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-03 20:53:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-03-03 20:53:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 421 states have (on average 1.3729216152019001) internal successors, (578), 421 states have internal predecessors, (578), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 20:53:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 886 transitions. [2025-03-03 20:53:35,228 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 886 transitions. Word has length 153 [2025-03-03 20:53:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 886 transitions. [2025-03-03 20:53:35,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 886 transitions. [2025-03-03 20:53:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 20:53:35,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:35,230 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:35,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:53:35,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:35,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:35,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1971357308, now seen corresponding path program 1 times [2025-03-03 20:53:35,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:35,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881933623] [2025-03-03 20:53:35,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:35,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:35,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 20:53:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 20:53:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881933623] [2025-03-03 20:53:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881933623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:53:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588632509] [2025-03-03 20:53:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:35,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:53:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:35,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:53:35,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:35,293 INFO L87 Difference]: Start difference. First operand 583 states and 886 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:35,380 INFO L93 Difference]: Finished difference Result 1540 states and 2340 transitions. [2025-03-03 20:53:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:53:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 20:53:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:35,386 INFO L225 Difference]: With dead ends: 1540 [2025-03-03 20:53:35,386 INFO L226 Difference]: Without dead ends: 1032 [2025-03-03 20:53:35,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:35,388 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 100 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:35,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 326 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:53:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-03 20:53:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 699. [2025-03-03 20:53:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 537 states have (on average 1.3743016759776536) internal successors, (738), 537 states have internal predecessors, (738), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 20:53:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1046 transitions. [2025-03-03 20:53:35,439 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1046 transitions. Word has length 154 [2025-03-03 20:53:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:35,439 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1046 transitions. [2025-03-03 20:53:35,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1046 transitions. [2025-03-03 20:53:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 20:53:35,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:35,441 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:53:35,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:35,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1138003138, now seen corresponding path program 1 times [2025-03-03 20:53:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:35,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164259384] [2025-03-03 20:53:35,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:35,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 20:53:35,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 20:53:35,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:35,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164259384] [2025-03-03 20:53:35,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164259384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:35,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:35,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:53:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558174389] [2025-03-03 20:53:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:35,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:53:35,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:35,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:53:35,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:53:35,760 INFO L87 Difference]: Start difference. First operand 699 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:35,916 INFO L93 Difference]: Finished difference Result 1626 states and 2396 transitions. [2025-03-03 20:53:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:53:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 20:53:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:35,922 INFO L225 Difference]: With dead ends: 1626 [2025-03-03 20:53:35,923 INFO L226 Difference]: Without dead ends: 983 [2025-03-03 20:53:35,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:53:35,925 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 162 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:35,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 294 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:53:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-03-03 20:53:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 737. [2025-03-03 20:53:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 568 states have (on average 1.3556338028169015) internal successors, (770), 568 states have internal predecessors, (770), 154 states have call successors, (154), 14 states have call predecessors, (154), 14 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 20:53:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1078 transitions. [2025-03-03 20:53:35,976 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1078 transitions. Word has length 154 [2025-03-03 20:53:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:35,976 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1078 transitions. [2025-03-03 20:53:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:53:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1078 transitions. [2025-03-03 20:53:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 20:53:35,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:35,978 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:35,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:53:35,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:35,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -492669772, now seen corresponding path program 1 times [2025-03-03 20:53:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012421567] [2025-03-03 20:53:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:35,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 20:53:36,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 20:53:36,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:36,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:53:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012421567] [2025-03-03 20:53:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012421567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:36,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:36,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:53:36,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861458846] [2025-03-03 20:53:36,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:53:36,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:36,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:53:36,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:53:36,319 INFO L87 Difference]: Start difference. First operand 737 states and 1078 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-03 20:53:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:36,952 INFO L93 Difference]: Finished difference Result 1609 states and 2352 transitions. [2025-03-03 20:53:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:53:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 155 [2025-03-03 20:53:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:36,958 INFO L225 Difference]: With dead ends: 1609 [2025-03-03 20:53:36,958 INFO L226 Difference]: Without dead ends: 946 [2025-03-03 20:53:36,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:53:36,960 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 552 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:36,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 630 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:53:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-03 20:53:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 853. [2025-03-03 20:53:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 683 states have (on average 1.3528550512445094) internal successors, (924), 683 states have internal predecessors, (924), 154 states have call successors, (154), 15 states have call predecessors, (154), 15 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 20:53:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1232 transitions. [2025-03-03 20:53:37,009 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1232 transitions. Word has length 155 [2025-03-03 20:53:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:37,009 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1232 transitions. [2025-03-03 20:53:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-03 20:53:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1232 transitions. [2025-03-03 20:53:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 20:53:37,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:37,011 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:37,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:53:37,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:37,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -689183277, now seen corresponding path program 1 times [2025-03-03 20:53:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759724195] [2025-03-03 20:53:37,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 20:53:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 20:53:37,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat