./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b28ed2134b8a500a12d5d4bc892752e1e825197b4bf6ff6b142642da12ed1a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:02:46,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:02:47,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:02:47,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:02:47,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:02:47,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:02:47,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:02:47,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:02:47,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:02:47,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:02:47,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:02:47,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:02:47,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:02:47,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:02:47,062 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:02:47,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:02:47,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:02:47,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:02:47,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:02:47,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:02:47,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:02:47,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:02:47,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:02:47,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:02:47,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:02:47,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:02:47,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:02:47,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:02:47,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:02:47,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:02:47,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:02:47,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:02:47,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:02:47,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:02:47,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:02:47,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:02:47,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:02:47,066 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-jdk21/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 -> b28ed2134b8a500a12d5d4bc892752e1e825197b4bf6ff6b142642da12ed1a0e [2025-02-05 23:02:47,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:02:47,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:02:47,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:02:47,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:02:47,374 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:02:47,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i [2025-02-05 23:02:48,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40ec6f80f/80b92579510f4500af0ec1d9ee51a277/FLAGf76e58a7d [2025-02-05 23:02:48,984 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:02:48,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i [2025-02-05 23:02:49,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40ec6f80f/80b92579510f4500af0ec1d9ee51a277/FLAGf76e58a7d [2025-02-05 23:02:49,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40ec6f80f/80b92579510f4500af0ec1d9ee51a277 [2025-02-05 23:02:49,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:02:49,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:02:49,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:02:49,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:02:49,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:02:49,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49, skipping insertion in model container [2025-02-05 23:02:49,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:02:49,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i[919,932] [2025-02-05 23:02:49,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:02:49,269 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:02:49,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i[919,932] [2025-02-05 23:02:49,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:02:49,328 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:02:49,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49 WrapperNode [2025-02-05 23:02:49,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:02:49,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:02:49,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:02:49,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:02:49,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,386 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-02-05 23:02:49,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:02:49,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:02:49,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:02:49,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:02:49,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,428 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-02-05 23:02:49,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:02:49,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:02:49,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:02:49,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:02:49,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (1/1) ... [2025-02-05 23:02:49,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:02:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:02:49,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:02:49,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:02:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:02:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:02:49,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:02:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:02:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:02:49,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:02:49,627 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:02:49,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:02:50,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-02-05 23:02:50,191 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:02:50,192 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:02:50,213 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:02:50,213 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:02:50,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:02:50 BoogieIcfgContainer [2025-02-05 23:02:50,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:02:50,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:02:50,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:02:50,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:02:50,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:02:49" (1/3) ... [2025-02-05 23:02:50,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e53420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:02:50, skipping insertion in model container [2025-02-05 23:02:50,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:02:49" (2/3) ... [2025-02-05 23:02:50,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e53420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:02:50, skipping insertion in model container [2025-02-05 23:02:50,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:02:50" (3/3) ... [2025-02-05 23:02:50,224 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i [2025-02-05 23:02:50,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:02:50,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-81.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:02:50,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:02:50,310 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;@497b984d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:02:50,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:02:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 23:02:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:02:50,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:02:50,332 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:02:50,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:02:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:02:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 263325644, now seen corresponding path program 1 times [2025-02-05 23:02:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:02:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461471035] [2025-02-05 23:02:50,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:02:50,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:02:50,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:02:50,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:50,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:02:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-05 23:02:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:02:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461471035] [2025-02-05 23:02:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461471035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:02:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239258843] [2025-02-05 23:02:50,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:02:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:02:50,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:02:50,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:02:50,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:02:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:02:50,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:02:50,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:02:50,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:02:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-05 23:02:51,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:02:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239258843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:02:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:02:51,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:02:51,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699135831] [2025-02-05 23:02:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:02:51,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:02:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:02:51,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:02:51,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:02:51,029 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:02:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:02:51,064 INFO L93 Difference]: Finished difference Result 203 states and 356 transitions. [2025-02-05 23:02:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:02:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-02-05 23:02:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:02:51,076 INFO L225 Difference]: With dead ends: 203 [2025-02-05 23:02:51,077 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 23:02:51,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-02-05 23:02:51,083 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:02:51,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:02:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 23:02:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-05 23:02:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 23:02:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2025-02-05 23:02:51,134 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 202 [2025-02-05 23:02:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:02:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2025-02-05 23:02:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:02:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2025-02-05 23:02:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:02:51,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:02:51,140 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:02:51,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:02:51,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:02:51,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:02:51,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:02:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash -587681913, now seen corresponding path program 1 times [2025-02-05 23:02:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:02:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082128681] [2025-02-05 23:02:51,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:02:51,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:02:51,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:02:51,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:51,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:02:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:02:52,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:02:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082128681] [2025-02-05 23:02:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082128681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:02:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:02:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:02:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435497347] [2025-02-05 23:02:52,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:02:52,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:02:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:02:52,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:02:52,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:02:52,892 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:02:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:02:53,155 INFO L93 Difference]: Finished difference Result 261 states and 409 transitions. [2025-02-05 23:02:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:02:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 23:02:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:02:53,158 INFO L225 Difference]: With dead ends: 261 [2025-02-05 23:02:53,158 INFO L226 Difference]: Without dead ends: 163 [2025-02-05 23:02:53,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:02:53,160 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 85 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:02:53,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 509 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:02:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-05 23:02:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2025-02-05 23:02:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 96 states have internal predecessors, (143), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 23:02:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 205 transitions. [2025-02-05 23:02:53,181 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 205 transitions. Word has length 202 [2025-02-05 23:02:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:02:53,185 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 205 transitions. [2025-02-05 23:02:53,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:02:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 205 transitions. [2025-02-05 23:02:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:02:53,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:02:53,193 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:02:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:02:53,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:02:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:02:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1899830920, now seen corresponding path program 1 times [2025-02-05 23:02:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:02:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055767313] [2025-02-05 23:02:53,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:02:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:02:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:02:53,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:02:53,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:02:53,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055767313] [2025-02-05 23:03:08,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055767313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:08,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:08,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:03:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013394151] [2025-02-05 23:03:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:03:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:08,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:03:08,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:03:08,712 INFO L87 Difference]: Start difference. First operand 129 states and 205 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:11,653 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2025-02-05 23:03:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:03:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 23:03:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:11,659 INFO L225 Difference]: With dead ends: 458 [2025-02-05 23:03:11,659 INFO L226 Difference]: Without dead ends: 332 [2025-02-05 23:03:11,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:03:11,665 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 681 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:11,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 628 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 23:03:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-05 23:03:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 152. [2025-02-05 23:03:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 119 states have internal predecessors, (180), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 23:03:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 242 transitions. [2025-02-05 23:03:11,700 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 242 transitions. Word has length 202 [2025-02-05 23:03:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:11,701 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 242 transitions. [2025-02-05 23:03:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 242 transitions. [2025-02-05 23:03:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:03:11,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:11,705 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:11,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:03:11,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:11,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1394272295, now seen corresponding path program 1 times [2025-02-05 23:03:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178370267] [2025-02-05 23:03:11,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:03:11,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:03:11,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:11,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:11,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178370267] [2025-02-05 23:03:11,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178370267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:03:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925924555] [2025-02-05 23:03:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:03:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:11,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:03:11,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:03:11,955 INFO L87 Difference]: Start difference. First operand 152 states and 242 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:12,079 INFO L93 Difference]: Finished difference Result 372 states and 591 transitions. [2025-02-05 23:03:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:03:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 23:03:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:12,083 INFO L225 Difference]: With dead ends: 372 [2025-02-05 23:03:12,083 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 23:03:12,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:03:12,084 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:12,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 443 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:03:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 23:03:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2025-02-05 23:03:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.489010989010989) internal successors, (271), 183 states have internal predecessors, (271), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 23:03:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2025-02-05 23:03:12,117 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 202 [2025-02-05 23:03:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:12,118 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2025-02-05 23:03:12,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2025-02-05 23:03:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:03:12,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:12,120 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:12,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:03:12,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1041826679, now seen corresponding path program 1 times [2025-02-05 23:03:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618783893] [2025-02-05 23:03:12,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:12,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:03:12,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:03:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618783893] [2025-02-05 23:03:20,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618783893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:03:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267284233] [2025-02-05 23:03:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:20,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:03:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:20,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:03:20,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:03:20,313 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:03:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:23,341 INFO L93 Difference]: Finished difference Result 850 states and 1291 transitions. [2025-02-05 23:03:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 23:03:23,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-02-05 23:03:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:23,348 INFO L225 Difference]: With dead ends: 850 [2025-02-05 23:03:23,348 INFO L226 Difference]: Without dead ends: 633 [2025-02-05 23:03:23,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2025-02-05 23:03:23,350 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1006 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:23,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 880 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:03:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-05 23:03:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 286. [2025-02-05 23:03:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 216 states have (on average 1.4490740740740742) internal successors, (313), 217 states have internal predecessors, (313), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:03:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 445 transitions. [2025-02-05 23:03:23,404 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 445 transitions. Word has length 202 [2025-02-05 23:03:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 445 transitions. [2025-02-05 23:03:23,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:03:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 445 transitions. [2025-02-05 23:03:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:03:23,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:23,412 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:23,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:03:23,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash 902758567, now seen corresponding path program 1 times [2025-02-05 23:03:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15457074] [2025-02-05 23:03:23,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:23,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:03:23,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:03:23,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:23,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:24,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15457074] [2025-02-05 23:03:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15457074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:03:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359053347] [2025-02-05 23:03:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:03:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:24,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:03:24,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:03:24,720 INFO L87 Difference]: Start difference. First operand 286 states and 445 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:25,406 INFO L93 Difference]: Finished difference Result 719 states and 1122 transitions. [2025-02-05 23:03:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:03:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-02-05 23:03:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:25,410 INFO L225 Difference]: With dead ends: 719 [2025-02-05 23:03:25,410 INFO L226 Difference]: Without dead ends: 502 [2025-02-05 23:03:25,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:03:25,411 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 270 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:25,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 730 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:03:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-05 23:03:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 328. [2025-02-05 23:03:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 259 states have internal predecessors, (384), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:03:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 516 transitions. [2025-02-05 23:03:25,447 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 516 transitions. Word has length 202 [2025-02-05 23:03:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:25,448 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 516 transitions. [2025-02-05 23:03:25,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 516 transitions. [2025-02-05 23:03:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 23:03:25,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:25,451 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:25,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:03:25,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:25,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash -830475766, now seen corresponding path program 1 times [2025-02-05 23:03:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109877970] [2025-02-05 23:03:25,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:25,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 23:03:25,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 23:03:25,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:25,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:26,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109877970] [2025-02-05 23:03:26,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109877970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:26,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:26,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:03:26,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766999092] [2025-02-05 23:03:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:26,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:03:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:26,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:03:26,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:03:26,076 INFO L87 Difference]: Start difference. First operand 328 states and 516 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:03:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:26,839 INFO L93 Difference]: Finished difference Result 890 states and 1376 transitions. [2025-02-05 23:03:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:03:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-02-05 23:03:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:26,844 INFO L225 Difference]: With dead ends: 890 [2025-02-05 23:03:26,844 INFO L226 Difference]: Without dead ends: 673 [2025-02-05 23:03:26,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:03:26,846 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 778 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:26,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 906 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:03:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-02-05 23:03:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 331. [2025-02-05 23:03:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 261 states have (on average 1.4904214559386972) internal successors, (389), 262 states have internal predecessors, (389), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:03:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 521 transitions. [2025-02-05 23:03:26,886 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 521 transitions. Word has length 202 [2025-02-05 23:03:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:26,889 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 521 transitions. [2025-02-05 23:03:26,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:03:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 521 transitions. [2025-02-05 23:03:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 23:03:26,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:26,891 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:26,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:03:26,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:26,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1153502676, now seen corresponding path program 1 times [2025-02-05 23:03:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845260749] [2025-02-05 23:03:26,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:26,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 23:03:26,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 23:03:26,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:26,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845260749] [2025-02-05 23:03:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845260749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:36,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:03:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075777730] [2025-02-05 23:03:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:03:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:03:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:03:36,595 INFO L87 Difference]: Start difference. First operand 331 states and 521 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:03:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:39,077 INFO L93 Difference]: Finished difference Result 824 states and 1266 transitions. [2025-02-05 23:03:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 23:03:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-02-05 23:03:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:39,081 INFO L225 Difference]: With dead ends: 824 [2025-02-05 23:03:39,081 INFO L226 Difference]: Without dead ends: 607 [2025-02-05 23:03:39,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-02-05 23:03:39,083 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 924 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:39,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 699 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 23:03:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-05 23:03:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 359. [2025-02-05 23:03:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 289 states have (on average 1.4982698961937717) internal successors, (433), 290 states have internal predecessors, (433), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:03:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 565 transitions. [2025-02-05 23:03:39,117 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 565 transitions. Word has length 203 [2025-02-05 23:03:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:39,117 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 565 transitions. [2025-02-05 23:03:39,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 23:03:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 565 transitions. [2025-02-05 23:03:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 23:03:39,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:39,119 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:39,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:03:39,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2144392267, now seen corresponding path program 1 times [2025-02-05 23:03:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588609253] [2025-02-05 23:03:39,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:39,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 23:03:39,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 23:03:39,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:39,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588609253] [2025-02-05 23:03:49,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588609253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:49,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:49,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:03:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335528400] [2025-02-05 23:03:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:49,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:03:49,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:49,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:03:49,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:03:49,797 INFO L87 Difference]: Start difference. First operand 359 states and 565 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:52,485 INFO L93 Difference]: Finished difference Result 800 states and 1236 transitions. [2025-02-05 23:03:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:03:52,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-02-05 23:03:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:52,489 INFO L225 Difference]: With dead ends: 800 [2025-02-05 23:03:52,489 INFO L226 Difference]: Without dead ends: 583 [2025-02-05 23:03:52,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:03:52,490 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 724 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:52,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 715 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 23:03:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-02-05 23:03:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 359. [2025-02-05 23:03:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 289 states have (on average 1.4982698961937717) internal successors, (433), 290 states have internal predecessors, (433), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:03:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 565 transitions. [2025-02-05 23:03:52,521 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 565 transitions. Word has length 203 [2025-02-05 23:03:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:52,521 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 565 transitions. [2025-02-05 23:03:52,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 565 transitions. [2025-02-05 23:03:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 23:03:52,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:52,523 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:52,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:03:52,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:52,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1997974547, now seen corresponding path program 1 times [2025-02-05 23:03:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647464797] [2025-02-05 23:03:52,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:52,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 23:03:52,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 23:03:52,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:52,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:03:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:03:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:03:52,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647464797] [2025-02-05 23:03:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647464797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:03:52,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:03:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:03:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149065869] [2025-02-05 23:03:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:03:52,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:03:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:03:52,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:03:52,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:03:52,957 INFO L87 Difference]: Start difference. First operand 359 states and 565 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:03:53,275 INFO L93 Difference]: Finished difference Result 696 states and 1085 transitions. [2025-02-05 23:03:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:03:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-02-05 23:03:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:03:53,279 INFO L225 Difference]: With dead ends: 696 [2025-02-05 23:03:53,279 INFO L226 Difference]: Without dead ends: 467 [2025-02-05 23:03:53,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:03:53,281 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:03:53,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 575 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:03:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-02-05 23:03:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 359. [2025-02-05 23:03:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 290 states have internal predecessors, (426), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:03:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 558 transitions. [2025-02-05 23:03:53,311 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 558 transitions. Word has length 203 [2025-02-05 23:03:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:03:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 558 transitions. [2025-02-05 23:03:53,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:03:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 558 transitions. [2025-02-05 23:03:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 23:03:53,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:03:53,313 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:03:53,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:03:53,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:03:53,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:03:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1103408331, now seen corresponding path program 1 times [2025-02-05 23:03:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:03:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781667744] [2025-02-05 23:03:53,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:03:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:03:53,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 23:03:53,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 23:03:53,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:03:53,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:04:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 23:04:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:04:02,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781667744] [2025-02-05 23:04:02,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781667744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:04:02,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:04:02,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 23:04:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909981124] [2025-02-05 23:04:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:04:02,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:04:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:04:02,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:04:02,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:04:02,620 INFO L87 Difference]: Start difference. First operand 359 states and 558 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:04:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:04:04,719 INFO L93 Difference]: Finished difference Result 755 states and 1157 transitions. [2025-02-05 23:04:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:04:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-02-05 23:04:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:04:04,723 INFO L225 Difference]: With dead ends: 755 [2025-02-05 23:04:04,723 INFO L226 Difference]: Without dead ends: 538 [2025-02-05 23:04:04,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:04:04,724 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 503 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:04:04,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 670 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:04:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-05 23:04:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 361. [2025-02-05 23:04:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 291 states have (on average 1.470790378006873) internal successors, (428), 292 states have internal predecessors, (428), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 23:04:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 560 transitions. [2025-02-05 23:04:04,756 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 560 transitions. Word has length 203 [2025-02-05 23:04:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:04:04,756 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 560 transitions. [2025-02-05 23:04:04,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 23:04:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 560 transitions. [2025-02-05 23:04:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 23:04:04,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:04:04,759 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:04:04,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:04:04,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:04:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:04:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash 106335978, now seen corresponding path program 1 times [2025-02-05 23:04:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:04:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081224903] [2025-02-05 23:04:04,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:04:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:04:04,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 23:04:04,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 23:04:04,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:04:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat