./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercodesize_ps-cn-500_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 e3e490624669738192d84194857eb5010bb4c249ca7cd2d385528db4c6ad1bc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:17:55,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:17:55,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:17:55,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:17:55,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:17:55,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:17:55,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:17:55,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:17:55,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:17:55,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:17:55,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:17:55,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:17:55,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:17:55,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:17:55,731 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:17:55,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:17:55,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:17:55,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:17:55,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:17:55,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:17:55,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:17:55,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:17:55,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:17:55,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:17:55,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:17:55,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:17:55,734 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 -> e3e490624669738192d84194857eb5010bb4c249ca7cd2d385528db4c6ad1bc5 [2025-03-08 11:17:55,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:17:55,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:17:55,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:17:55,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:17:55,977 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:17:55,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-28.i [2025-03-08 11:17:57,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc9cbd26/a7d5ae07687e4a29aa7762f7161964a6/FLAG55f2bf861 [2025-03-08 11:17:57,409 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:17:57,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-28.i [2025-03-08 11:17:57,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc9cbd26/a7d5ae07687e4a29aa7762f7161964a6/FLAG55f2bf861 [2025-03-08 11:17:57,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc9cbd26/a7d5ae07687e4a29aa7762f7161964a6 [2025-03-08 11:17:57,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:17:57,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:17:57,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:17:57,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:17:57,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:17:57,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:57" (1/1) ... [2025-03-08 11:17:57,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:57, skipping insertion in model container [2025-03-08 11:17:57,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:57" (1/1) ... [2025-03-08 11:17:57,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:17:57,866 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_fillercodesize_ps-cn-500_file-28.i[916,929] [2025-03-08 11:17:58,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:17:58,042 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:17:58,051 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_fillercodesize_ps-cn-500_file-28.i[916,929] [2025-03-08 11:17:58,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:17:58,143 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:17:58,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58 WrapperNode [2025-03-08 11:17:58,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:17:58,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:17:58,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:17:58,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:17:58,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,222 INFO L138 Inliner]: procedures = 26, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 980 [2025-03-08 11:17:58,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:17:58,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:17:58,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:17:58,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:17:58,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,268 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-08 11:17:58,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:17:58,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:17:58,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:17:58,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:17:58,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (1/1) ... [2025-03-08 11:17:58,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:17:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:17:58,345 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-08 11:17:58,349 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-08 11:17:58,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:17:58,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:17:58,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:17:58,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:17:58,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:17:58,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:17:58,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:17:58,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:17:59,297 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc property_#t~bitwise101#1;havoc property_#t~short102#1; [2025-03-08 11:17:59,466 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-08 11:17:59,466 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:17:59,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:17:59,510 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 11:17:59,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:59 BoogieIcfgContainer [2025-03-08 11:17:59,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:17:59,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:17:59,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:17:59,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:17:59,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:17:57" (1/3) ... [2025-03-08 11:17:59,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603038aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:59, skipping insertion in model container [2025-03-08 11:17:59,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:58" (2/3) ... [2025-03-08 11:17:59,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603038aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:59, skipping insertion in model container [2025-03-08 11:17:59,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:59" (3/3) ... [2025-03-08 11:17:59,520 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-28.i [2025-03-08 11:17:59,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:17:59,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-28.i that has 2 procedures, 414 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:17:59,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:17:59,614 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;@750bd758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:17:59,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:17:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 414 states, 283 states have (on average 1.558303886925795) internal successors, (441), 284 states have internal predecessors, (441), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 11:17:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2025-03-08 11:17:59,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:59,661 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:17:59,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2058741278, now seen corresponding path program 1 times [2025-03-08 11:17:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:59,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812665700] [2025-03-08 11:17:59,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:59,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-03-08 11:17:59,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-03-08 11:17:59,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:59,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2025-03-08 11:18:00,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:00,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812665700] [2025-03-08 11:18:00,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812665700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:18:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677425407] [2025-03-08 11:18:00,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:00,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:18:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:00,260 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-08 11:18:00,262 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-08 11:18:00,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-03-08 11:18:00,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-03-08 11:18:00,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:00,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:00,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:18:00,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:18:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2025-03-08 11:18:00,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:18:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677425407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:18:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:18:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514863465] [2025-03-08 11:18:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:18:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:00,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:18:00,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:18:00,762 INFO L87 Difference]: Start difference. First operand has 414 states, 283 states have (on average 1.558303886925795) internal successors, (441), 284 states have internal predecessors, (441), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2025-03-08 11:18:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:00,859 INFO L93 Difference]: Finished difference Result 805 states and 1487 transitions. [2025-03-08 11:18:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:18:00,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) Word has length 804 [2025-03-08 11:18:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:00,869 INFO L225 Difference]: With dead ends: 805 [2025-03-08 11:18:00,870 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 11:18:00,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 805 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-08 11:18:00,878 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:00,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 11:18:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-08 11:18:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 264 states have (on average 1.5227272727272727) internal successors, (402), 264 states have internal predecessors, (402), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-08 11:18:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 658 transitions. [2025-03-08 11:18:00,955 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 658 transitions. Word has length 804 [2025-03-08 11:18:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:00,955 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 658 transitions. [2025-03-08 11:18:00,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2025-03-08 11:18:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 658 transitions. [2025-03-08 11:18:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:00,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:00,973 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:00,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:18:01,174 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-08 11:18:01,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:01,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash -355558201, now seen corresponding path program 1 times [2025-03-08 11:18:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923718870] [2025-03-08 11:18:01,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:01,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:01,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:01,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:01,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923718870] [2025-03-08 11:18:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923718870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:01,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556517527] [2025-03-08 11:18:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:01,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:01,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:01,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:01,947 INFO L87 Difference]: Start difference. First operand 394 states and 658 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:02,080 INFO L93 Difference]: Finished difference Result 1176 states and 1968 transitions. [2025-03-08 11:18:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:02,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:02,091 INFO L225 Difference]: With dead ends: 1176 [2025-03-08 11:18:02,093 INFO L226 Difference]: Without dead ends: 785 [2025-03-08 11:18:02,095 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-08 11:18:02,095 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 642 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:02,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1258 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-08 11:18:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2025-03-08 11:18:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 524 states have (on average 1.5229007633587786) internal successors, (798), 524 states have internal predecessors, (798), 256 states have call successors, (256), 2 states have call predecessors, (256), 2 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-08 11:18:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1310 transitions. [2025-03-08 11:18:02,239 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1310 transitions. Word has length 805 [2025-03-08 11:18:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:02,242 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1310 transitions. [2025-03-08 11:18:02,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1310 transitions. [2025-03-08 11:18:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:02,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:02,258 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:02,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:18:02,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:02,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1776991065, now seen corresponding path program 1 times [2025-03-08 11:18:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:02,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880887658] [2025-03-08 11:18:02,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:02,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:02,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:02,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:02,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:02,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:02,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880887658] [2025-03-08 11:18:02,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880887658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:02,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109589012] [2025-03-08 11:18:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:02,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:02,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:02,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:02,607 INFO L87 Difference]: Start difference. First operand 783 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:02,728 INFO L93 Difference]: Finished difference Result 2039 states and 3420 transitions. [2025-03-08 11:18:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:02,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:02,739 INFO L225 Difference]: With dead ends: 2039 [2025-03-08 11:18:02,739 INFO L226 Difference]: Without dead ends: 1259 [2025-03-08 11:18:02,741 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-08 11:18:02,742 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 400 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:02,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1328 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-08 11:18:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1255. [2025-03-08 11:18:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 912 states have (on average 1.5657894736842106) internal successors, (1428), 914 states have internal predecessors, (1428), 338 states have call successors, (338), 4 states have call predecessors, (338), 4 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-03-08 11:18:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2104 transitions. [2025-03-08 11:18:02,861 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2104 transitions. Word has length 805 [2025-03-08 11:18:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:02,862 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 2104 transitions. [2025-03-08 11:18:02,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2104 transitions. [2025-03-08 11:18:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:02,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:02,869 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:02,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:18:02,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1676079098, now seen corresponding path program 1 times [2025-03-08 11:18:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33750670] [2025-03-08 11:18:02,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:02,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:02,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:02,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:02,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33750670] [2025-03-08 11:18:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33750670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36208090] [2025-03-08 11:18:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:03,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:03,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:03,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:03,185 INFO L87 Difference]: Start difference. First operand 1255 states and 2104 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:03,337 INFO L93 Difference]: Finished difference Result 3755 states and 6298 transitions. [2025-03-08 11:18:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:03,351 INFO L225 Difference]: With dead ends: 3755 [2025-03-08 11:18:03,351 INFO L226 Difference]: Without dead ends: 2503 [2025-03-08 11:18:03,355 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-08 11:18:03,356 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 633 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:03,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1774 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-03-08 11:18:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1567. [2025-03-08 11:18:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1224 states have (on average 1.6143790849673203) internal successors, (1976), 1226 states have internal predecessors, (1976), 338 states have call successors, (338), 4 states have call predecessors, (338), 4 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-03-08 11:18:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2652 transitions. [2025-03-08 11:18:03,489 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2652 transitions. Word has length 805 [2025-03-08 11:18:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2652 transitions. [2025-03-08 11:18:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2652 transitions. [2025-03-08 11:18:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:03,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:03,496 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:03,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:18:03,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1045620473, now seen corresponding path program 1 times [2025-03-08 11:18:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369654331] [2025-03-08 11:18:03,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:03,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:03,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369654331] [2025-03-08 11:18:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369654331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815795964] [2025-03-08 11:18:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:03,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:03,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:03,827 INFO L87 Difference]: Start difference. First operand 1567 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:03,978 INFO L93 Difference]: Finished difference Result 4357 states and 7364 transitions. [2025-03-08 11:18:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:03,995 INFO L225 Difference]: With dead ends: 4357 [2025-03-08 11:18:03,996 INFO L226 Difference]: Without dead ends: 2793 [2025-03-08 11:18:04,002 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-08 11:18:04,003 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 410 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:04,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1465 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2025-03-08 11:18:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2789. [2025-03-08 11:18:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2200 states have (on average 1.6090909090909091) internal successors, (3540), 2206 states have internal predecessors, (3540), 580 states have call successors, (580), 8 states have call predecessors, (580), 8 states have return successors, (580), 574 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-08 11:18:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4700 transitions. [2025-03-08 11:18:04,190 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4700 transitions. Word has length 805 [2025-03-08 11:18:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:04,192 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4700 transitions. [2025-03-08 11:18:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4700 transitions. [2025-03-08 11:18:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:04,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:04,199 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:04,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:18:04,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:04,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1167438790, now seen corresponding path program 1 times [2025-03-08 11:18:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:04,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934920079] [2025-03-08 11:18:04,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:04,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:04,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:04,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:04,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934920079] [2025-03-08 11:18:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934920079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:04,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696482128] [2025-03-08 11:18:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:04,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:04,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:04,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:04,464 INFO L87 Difference]: Start difference. First operand 2789 states and 4700 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:04,667 INFO L93 Difference]: Finished difference Result 7129 states and 11918 transitions. [2025-03-08 11:18:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:04,692 INFO L225 Difference]: With dead ends: 7129 [2025-03-08 11:18:04,692 INFO L226 Difference]: Without dead ends: 4343 [2025-03-08 11:18:04,700 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-08 11:18:04,701 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 623 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:04,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1318 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2025-03-08 11:18:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 2789. [2025-03-08 11:18:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2200 states have (on average 1.6018181818181818) internal successors, (3524), 2206 states have internal predecessors, (3524), 580 states have call successors, (580), 8 states have call predecessors, (580), 8 states have return successors, (580), 574 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-08 11:18:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4684 transitions. [2025-03-08 11:18:04,963 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4684 transitions. Word has length 805 [2025-03-08 11:18:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:04,964 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4684 transitions. [2025-03-08 11:18:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4684 transitions. [2025-03-08 11:18:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:04,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:04,989 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:18:04,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:04,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2129052807, now seen corresponding path program 1 times [2025-03-08 11:18:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653610066] [2025-03-08 11:18:04,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:05,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:05,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:05,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653610066] [2025-03-08 11:18:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653610066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:05,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17467487] [2025-03-08 11:18:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:05,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:05,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:05,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:05,304 INFO L87 Difference]: Start difference. First operand 2789 states and 4684 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:05,567 INFO L93 Difference]: Finished difference Result 7615 states and 12752 transitions. [2025-03-08 11:18:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:05,592 INFO L225 Difference]: With dead ends: 7615 [2025-03-08 11:18:05,592 INFO L226 Difference]: Without dead ends: 4829 [2025-03-08 11:18:05,601 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-08 11:18:05,602 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 359 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:05,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1253 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2025-03-08 11:18:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4825. [2025-03-08 11:18:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 3732 states have (on average 1.5744908896034298) internal successors, (5876), 3746 states have internal predecessors, (5876), 1076 states have call successors, (1076), 16 states have call predecessors, (1076), 16 states have return successors, (1076), 1062 states have call predecessors, (1076), 1076 states have call successors, (1076) [2025-03-08 11:18:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 8028 transitions. [2025-03-08 11:18:05,913 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 8028 transitions. Word has length 805 [2025-03-08 11:18:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:05,914 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 8028 transitions. [2025-03-08 11:18:05,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 8028 transitions. [2025-03-08 11:18:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:05,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:05,928 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:18:05,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1954563576, now seen corresponding path program 1 times [2025-03-08 11:18:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130891193] [2025-03-08 11:18:05,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:05,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:06,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:06,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130891193] [2025-03-08 11:18:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130891193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:06,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:06,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667181900] [2025-03-08 11:18:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:06,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:06,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:06,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:06,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:06,294 INFO L87 Difference]: Start difference. First operand 4825 states and 8028 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:06,452 INFO L93 Difference]: Finished difference Result 9679 states and 16117 transitions. [2025-03-08 11:18:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:06,476 INFO L225 Difference]: With dead ends: 9679 [2025-03-08 11:18:06,476 INFO L226 Difference]: Without dead ends: 4857 [2025-03-08 11:18:06,488 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-08 11:18:06,488 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:06,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1267 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2025-03-08 11:18:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 4857. [2025-03-08 11:18:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4857 states, 3764 states have (on average 1.569606801275239) internal successors, (5908), 3778 states have internal predecessors, (5908), 1076 states have call successors, (1076), 16 states have call predecessors, (1076), 16 states have return successors, (1076), 1062 states have call predecessors, (1076), 1076 states have call successors, (1076) [2025-03-08 11:18:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 8060 transitions. [2025-03-08 11:18:06,758 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 8060 transitions. Word has length 805 [2025-03-08 11:18:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:06,759 INFO L471 AbstractCegarLoop]: Abstraction has 4857 states and 8060 transitions. [2025-03-08 11:18:06,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 8060 transitions. [2025-03-08 11:18:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:06,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:06,769 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:06,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:18:06,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:06,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1891707081, now seen corresponding path program 1 times [2025-03-08 11:18:06,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780493742] [2025-03-08 11:18:06,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:06,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:06,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:06,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:06,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:07,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:07,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780493742] [2025-03-08 11:18:07,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780493742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906906004] [2025-03-08 11:18:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:07,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:07,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:07,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:07,455 INFO L87 Difference]: Start difference. First operand 4857 states and 8060 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:07,859 INFO L93 Difference]: Finished difference Result 13469 states and 22294 transitions. [2025-03-08 11:18:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:07,898 INFO L225 Difference]: With dead ends: 13469 [2025-03-08 11:18:07,898 INFO L226 Difference]: Without dead ends: 8615 [2025-03-08 11:18:07,914 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-08 11:18:07,915 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 416 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:07,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1323 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8615 states. [2025-03-08 11:18:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8615 to 8613. [2025-03-08 11:18:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8613 states, 6428 states have (on average 1.5413814561294337) internal successors, (9908), 6456 states have internal predecessors, (9908), 2152 states have call successors, (2152), 32 states have call predecessors, (2152), 32 states have return successors, (2152), 2124 states have call predecessors, (2152), 2152 states have call successors, (2152) [2025-03-08 11:18:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 14212 transitions. [2025-03-08 11:18:08,423 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 14212 transitions. Word has length 805 [2025-03-08 11:18:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:08,424 INFO L471 AbstractCegarLoop]: Abstraction has 8613 states and 14212 transitions. [2025-03-08 11:18:08,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 14212 transitions. [2025-03-08 11:18:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:08,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:08,434 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:08,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:18:08,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1912044456, now seen corresponding path program 1 times [2025-03-08 11:18:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:08,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181809918] [2025-03-08 11:18:08,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:08,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:08,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181809918] [2025-03-08 11:18:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181809918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:09,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:18:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428959168] [2025-03-08 11:18:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:09,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:18:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:09,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:18:09,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:18:09,203 INFO L87 Difference]: Start difference. First operand 8613 states and 14212 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:11,087 INFO L93 Difference]: Finished difference Result 27467 states and 45083 transitions. [2025-03-08 11:18:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:18:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:11,169 INFO L225 Difference]: With dead ends: 27467 [2025-03-08 11:18:11,169 INFO L226 Difference]: Without dead ends: 18857 [2025-03-08 11:18:11,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:18:11,202 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 958 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:11,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2157 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:18:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18857 states. [2025-03-08 11:18:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18857 to 14649. [2025-03-08 11:18:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14649 states, 11408 states have (on average 1.5603085553997196) internal successors, (17800), 11452 states have internal predecessors, (17800), 3180 states have call successors, (3180), 60 states have call predecessors, (3180), 60 states have return successors, (3180), 3136 states have call predecessors, (3180), 3180 states have call successors, (3180) [2025-03-08 11:18:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14649 states to 14649 states and 24160 transitions. [2025-03-08 11:18:12,367 INFO L78 Accepts]: Start accepts. Automaton has 14649 states and 24160 transitions. Word has length 805 [2025-03-08 11:18:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:12,368 INFO L471 AbstractCegarLoop]: Abstraction has 14649 states and 24160 transitions. [2025-03-08 11:18:12,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14649 states and 24160 transitions. [2025-03-08 11:18:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:12,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:12,384 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:12,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:18:12,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:12,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -13488855, now seen corresponding path program 1 times [2025-03-08 11:18:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341506328] [2025-03-08 11:18:12,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:12,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:12,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:12,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:13,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341506328] [2025-03-08 11:18:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341506328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:18:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074921100] [2025-03-08 11:18:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:18:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:18:13,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:18:13,418 INFO L87 Difference]: Start difference. First operand 14649 states and 24160 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:15,618 INFO L93 Difference]: Finished difference Result 44181 states and 72954 transitions. [2025-03-08 11:18:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:18:15,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-03-08 11:18:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:15,733 INFO L225 Difference]: With dead ends: 44181 [2025-03-08 11:18:15,733 INFO L226 Difference]: Without dead ends: 29535 [2025-03-08 11:18:15,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:18:15,775 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 648 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:15,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 2800 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:18:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29535 states. [2025-03-08 11:18:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29535 to 29413. [2025-03-08 11:18:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29413 states, 22932 states have (on average 1.557474271759986) internal successors, (35716), 23020 states have internal predecessors, (35716), 6360 states have call successors, (6360), 120 states have call predecessors, (6360), 120 states have return successors, (6360), 6272 states have call predecessors, (6360), 6360 states have call successors, (6360) [2025-03-08 11:18:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29413 states to 29413 states and 48436 transitions. [2025-03-08 11:18:17,350 INFO L78 Accepts]: Start accepts. Automaton has 29413 states and 48436 transitions. Word has length 805 [2025-03-08 11:18:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:17,351 INFO L471 AbstractCegarLoop]: Abstraction has 29413 states and 48436 transitions. [2025-03-08 11:18:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-03-08 11:18:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29413 states and 48436 transitions. [2025-03-08 11:18:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-08 11:18:17,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:17,371 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:18:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:18:17,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1038980854, now seen corresponding path program 1 times [2025-03-08 11:18:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410378663] [2025-03-08 11:18:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:17,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-08 11:18:17,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-08 11:18:17,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:17,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-03-08 11:18:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410378663] [2025-03-08 11:18:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410378663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:29,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 11:18:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691348192] [2025-03-08 11:18:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 11:18:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:29,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 11:18:29,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:18:29,308 INFO L87 Difference]: Start difference. First operand 29413 states and 48436 transitions. Second operand has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 6 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 6 states have call predecessors, (128), 6 states have call successors, (128)