./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cad4d7b451aedc3eeb7972a3b18afdd15d9eeb92c7ee5d5c9ec843657b913929 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:43:51,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:43:51,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:43:51,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:43:51,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:43:51,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:43:51,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:43:51,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:43:51,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:43:51,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:43:51,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:43:51,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:43:51,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:43:51,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:43:51,381 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:43:51,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:43:51,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:43:51,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:43:51,383 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:43:51,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:43:51,383 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:43:51,383 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:43:51,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:43:51,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:43:51,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:43:51,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:43:51,385 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cad4d7b451aedc3eeb7972a3b18afdd15d9eeb92c7ee5d5c9ec843657b913929 [2025-03-17 01:43:51,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:43:51,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:43:51,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:43:51,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:43:51,624 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:43:51,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i [2025-03-17 01:43:52,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef28c4a3/d437a44dac514c748b634e6920380081/FLAGe87b75793 [2025-03-17 01:43:53,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:43:53,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i [2025-03-17 01:43:53,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef28c4a3/d437a44dac514c748b634e6920380081/FLAGe87b75793 [2025-03-17 01:43:53,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef28c4a3/d437a44dac514c748b634e6920380081 [2025-03-17 01:43:53,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:43:53,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:43:53,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:43:53,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:43:53,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:43:53,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa177a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53, skipping insertion in model container [2025-03-17 01:43:53,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:43:53,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i[919,932] [2025-03-17 01:43:53,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:43:53,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:43:53,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i[919,932] [2025-03-17 01:43:53,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:43:53,618 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:43:53,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53 WrapperNode [2025-03-17 01:43:53,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:43:53,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:43:53,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:43:53,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:43:53,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,664 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-03-17 01:43:53,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:43:53,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:43:53,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:43:53,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:43:53,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:43:53,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:43:53,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:43:53,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:43:53,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:43:53,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (1/1) ... [2025-03-17 01:43:53,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:43:53,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:43:53,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:43:53,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:43:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:43:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:43:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:43:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:43:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:43:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:43:53,828 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:43:53,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:43:54,223 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-17 01:43:54,258 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 01:43:54,258 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:43:54,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:43:54,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:43:54,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:43:54 BoogieIcfgContainer [2025-03-17 01:43:54,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:43:54,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:43:54,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:43:54,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:43:54,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:43:53" (1/3) ... [2025-03-17 01:43:54,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33eae3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:43:54, skipping insertion in model container [2025-03-17 01:43:54,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:43:53" (2/3) ... [2025-03-17 01:43:54,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33eae3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:43:54, skipping insertion in model container [2025-03-17 01:43:54,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:43:54" (3/3) ... [2025-03-17 01:43:54,285 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i [2025-03-17 01:43:54,296 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:43:54,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-28.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:43:54,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:43:54,355 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;@5e7bb444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:43:54,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:43:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 01:43:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:43:54,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:54,376 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:54,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:54,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash -628971230, now seen corresponding path program 1 times [2025-03-17 01:43:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:43:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811289454] [2025-03-17 01:43:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:43:54,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:43:54,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:43:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:54,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-17 01:43:54,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:43:54,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811289454] [2025-03-17 01:43:54,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811289454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:43:54,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388862044] [2025-03-17 01:43:54,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:54,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:43:54,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:43:54,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:43:54,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:43:54,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:43:54,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:43:54,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:54,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:54,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:43:54,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:43:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-17 01:43:54,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:43:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388862044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:43:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:43:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:43:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442049641] [2025-03-17 01:43:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:43:54,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:43:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:43:54,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:43:54,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:43:54,949 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 01:43:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:54,972 INFO L93 Difference]: Finished difference Result 194 states and 338 transitions. [2025-03-17 01:43:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:43:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-03-17 01:43:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:54,979 INFO L225 Difference]: With dead ends: 194 [2025-03-17 01:43:54,979 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 01:43:54,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:43:54,984 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:54,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:43:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 01:43:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 01:43:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 01:43:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 149 transitions. [2025-03-17 01:43:55,016 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 149 transitions. Word has length 190 [2025-03-17 01:43:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:55,017 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 149 transitions. [2025-03-17 01:43:55,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 01:43:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2025-03-17 01:43:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:43:55,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:55,020 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:55,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:43:55,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:43:55,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:55,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash -14787323, now seen corresponding path program 1 times [2025-03-17 01:43:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:43:55,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008211201] [2025-03-17 01:43:55,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:43:55,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:43:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:43:55,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 01:43:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:43:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008211201] [2025-03-17 01:43:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008211201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:43:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:43:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:43:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58979454] [2025-03-17 01:43:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:43:55,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:43:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:43:55,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:43:55,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:55,475 INFO L87 Difference]: Start difference. First operand 96 states and 149 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:55,527 INFO L93 Difference]: Finished difference Result 260 states and 401 transitions. [2025-03-17 01:43:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:43:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-17 01:43:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:55,532 INFO L225 Difference]: With dead ends: 260 [2025-03-17 01:43:55,532 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 01:43:55,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:55,536 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 90 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:55,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:43:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 01:43:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-03-17 01:43:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 109 states have internal predecessors, (148), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:43:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 250 transitions. [2025-03-17 01:43:55,564 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 250 transitions. Word has length 190 [2025-03-17 01:43:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:55,565 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 250 transitions. [2025-03-17 01:43:55,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 250 transitions. [2025-03-17 01:43:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:43:55,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:55,570 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:55,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:43:55,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:55,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 872716358, now seen corresponding path program 1 times [2025-03-17 01:43:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:43:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2314183] [2025-03-17 01:43:55,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:55,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:43:55,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:43:55,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:43:55,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:55,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 01:43:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:43:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2314183] [2025-03-17 01:43:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2314183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:43:55,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:43:55,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:43:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676998198] [2025-03-17 01:43:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:43:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:43:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:43:55,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:43:55,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:55,759 INFO L87 Difference]: Start difference. First operand 162 states and 250 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:55,785 INFO L93 Difference]: Finished difference Result 325 states and 503 transitions. [2025-03-17 01:43:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:43:55,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-17 01:43:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:55,791 INFO L225 Difference]: With dead ends: 325 [2025-03-17 01:43:55,792 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 01:43:55,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:55,795 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:55,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:43:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 01:43:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-17 01:43:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 111 states have internal predecessors, (150), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 01:43:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2025-03-17 01:43:55,813 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 190 [2025-03-17 01:43:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:55,814 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2025-03-17 01:43:55,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2025-03-17 01:43:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 01:43:55,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:55,817 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:55,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:43:55,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:55,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash -124355995, now seen corresponding path program 1 times [2025-03-17 01:43:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:43:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90589616] [2025-03-17 01:43:55,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:43:55,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 01:43:55,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 01:43:55,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:55,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 01:43:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:43:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90589616] [2025-03-17 01:43:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90589616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:43:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:43:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:43:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195939428] [2025-03-17 01:43:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:43:56,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:43:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:43:56,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:43:56,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:56,046 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:56,126 INFO L93 Difference]: Finished difference Result 488 states and 752 transitions. [2025-03-17 01:43:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:43:56,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-17 01:43:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:56,130 INFO L225 Difference]: With dead ends: 488 [2025-03-17 01:43:56,130 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 01:43:56,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:56,131 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 92 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:56,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 294 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:43:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 01:43:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2025-03-17 01:43:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 216 states have (on average 1.3611111111111112) internal successors, (294), 218 states have internal predecessors, (294), 102 states have call successors, (102), 4 states have call predecessors, (102), 4 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 01:43:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 498 transitions. [2025-03-17 01:43:56,190 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 498 transitions. Word has length 190 [2025-03-17 01:43:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:56,191 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 498 transitions. [2025-03-17 01:43:56,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 498 transitions. [2025-03-17 01:43:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:43:56,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:56,193 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:56,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:43:56,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:56,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2041147330, now seen corresponding path program 1 times [2025-03-17 01:43:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:43:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92269740] [2025-03-17 01:43:56,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:43:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:43:56,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:43:56,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:56,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:43:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-17 01:43:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:43:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92269740] [2025-03-17 01:43:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92269740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:43:56,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:43:56,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:43:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499776778] [2025-03-17 01:43:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:43:56,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:43:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:43:56,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:43:56,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:56,323 INFO L87 Difference]: Start difference. First operand 323 states and 498 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:43:56,363 INFO L93 Difference]: Finished difference Result 645 states and 995 transitions. [2025-03-17 01:43:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:43:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-17 01:43:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:43:56,366 INFO L225 Difference]: With dead ends: 645 [2025-03-17 01:43:56,366 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 01:43:56,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:43:56,367 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:43:56,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:43:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 01:43:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2025-03-17 01:43:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 214 states have (on average 1.3457943925233644) internal successors, (288), 216 states have internal predecessors, (288), 102 states have call successors, (102), 4 states have call predecessors, (102), 4 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 01:43:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 492 transitions. [2025-03-17 01:43:56,405 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 492 transitions. Word has length 191 [2025-03-17 01:43:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:43:56,406 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 492 transitions. [2025-03-17 01:43:56,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-17 01:43:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 492 transitions. [2025-03-17 01:43:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:43:56,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:43:56,409 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:43:56,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:43:56,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:43:56,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:43:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1044074977, now seen corresponding path program 1 times [2025-03-17 01:43:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:43:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944815126] [2025-03-17 01:43:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:43:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:43:56,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:43:56,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:43:56,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:43:56,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat