./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.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 16ff97a558b757e7503fa9deac406f5ee96ecd7ac74bc40e1b185d8532e8df37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:49:54,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:49:54,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:49:54,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:49:54,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:49:54,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:49:54,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:49:54,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:49:54,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:49:54,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:49:54,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:49:54,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:49:54,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:49:54,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:49:54,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:49:54,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:49:54,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:49:54,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:49:54,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:49:54,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:49:54,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:49:54,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:49:54,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:49:54,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:49:54,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:54,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:49:54,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:49:54,345 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 -> 16ff97a558b757e7503fa9deac406f5ee96ecd7ac74bc40e1b185d8532e8df37 [2025-03-03 19:49:54,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:49:54,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:49:54,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:49:54,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:49:54,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:49:54,570 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-250_file-66.i [2025-03-03 19:49:55,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69a0169d/dd650991b74d423781a4cfe93c50e702/FLAG835d39f89 [2025-03-03 19:49:55,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:49:55,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-03 19:49:55,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69a0169d/dd650991b74d423781a4cfe93c50e702/FLAG835d39f89 [2025-03-03 19:49:55,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69a0169d/dd650991b74d423781a4cfe93c50e702 [2025-03-03 19:49:55,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:49:55,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:49:55,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:55,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:49:55,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:49:55,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:55" (1/1) ... [2025-03-03 19:49:55,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126c0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:55, skipping insertion in model container [2025-03-03 19:49:55,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:55" (1/1) ... [2025-03-03 19:49:55,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:49:56,039 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-250_file-66.i[916,929] [2025-03-03 19:49:56,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:56,178 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:49:56,185 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-250_file-66.i[916,929] [2025-03-03 19:49:56,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:56,251 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:49:56,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56 WrapperNode [2025-03-03 19:49:56,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:56,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:56,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:49:56,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:49:56,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,306 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2025-03-03 19:49:56,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:56,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:49:56,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:49:56,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:49:56,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:49:56,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:49:56,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:49:56,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:49:56,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:49:56,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (1/1) ... [2025-03-03 19:49:56,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:56,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:56,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:49:56,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:49:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:49:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:49:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:49:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:49:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:49:56,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:49:56,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:49:56,519 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:49:57,076 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 19:49:57,076 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:49:57,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:49:57,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:49:57,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:57 BoogieIcfgContainer [2025-03-03 19:49:57,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:49:57,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:49:57,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:49:57,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:49:57,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:49:55" (1/3) ... [2025-03-03 19:49:57,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c703f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:57, skipping insertion in model container [2025-03-03 19:49:57,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:56" (2/3) ... [2025-03-03 19:49:57,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c703f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:57, skipping insertion in model container [2025-03-03 19:49:57,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:57" (3/3) ... [2025-03-03 19:49:57,106 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-03 19:49:57,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:49:57,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-66.i that has 2 procedures, 225 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:49:57,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:49:57,169 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;@1401ea30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:49:57,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:49:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 148 states have (on average 1.527027027027027) internal successors, (226), 149 states have internal predecessors, (226), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:49:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-03 19:49:57,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:57,194 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:57,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:57,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1840790759, now seen corresponding path program 1 times [2025-03-03 19:49:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026268334] [2025-03-03 19:49:57,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-03 19:49:57,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-03 19:49:57,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:57,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:49:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026268334] [2025-03-03 19:49:57,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026268334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:57,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210570074] [2025-03-03 19:49:57,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:57,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:57,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:57,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:57,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:49:57,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-03 19:49:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-03 19:49:57,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:57,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:57,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:49:57,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:49:57,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:49:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210570074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:57,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:49:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:49:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291319916] [2025-03-03 19:49:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:49:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:57,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:49:57,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:49:57,984 INFO L87 Difference]: Start difference. First operand has 225 states, 148 states have (on average 1.527027027027027) internal successors, (226), 149 states have internal predecessors, (226), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:58,044 INFO L93 Difference]: Finished difference Result 444 states and 817 transitions. [2025-03-03 19:49:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:49:58,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 476 [2025-03-03 19:49:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:58,052 INFO L225 Difference]: With dead ends: 444 [2025-03-03 19:49:58,052 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 19:49:58,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:49:58,062 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:58,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 19:49:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-03 19:49:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 146 states have internal predecessors, (221), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:49:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 369 transitions. [2025-03-03 19:49:58,124 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 369 transitions. Word has length 476 [2025-03-03 19:49:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:58,126 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 369 transitions. [2025-03-03 19:49:58,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:49:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 369 transitions. [2025-03-03 19:49:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-03 19:49:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:58,137 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:58,146 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-03 19:49:58,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:49:58,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:58,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2016674715, now seen corresponding path program 1 times [2025-03-03 19:49:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:58,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51028935] [2025-03-03 19:49:58,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-03 19:49:58,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-03 19:49:58,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:58,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51028935] [2025-03-03 19:49:58,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51028935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:58,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:58,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222982441] [2025-03-03 19:49:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:58,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:58,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:58,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:58,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:58,695 INFO L87 Difference]: Start difference. First operand 222 states and 369 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:58,768 INFO L93 Difference]: Finished difference Result 579 states and 962 transitions. [2025-03-03 19:49:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:58,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-03-03 19:49:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:58,774 INFO L225 Difference]: With dead ends: 579 [2025-03-03 19:49:58,776 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 19:49:58,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:58,780 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 206 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:58,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 709 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 19:49:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2025-03-03 19:49:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 242 states have (on average 1.5206611570247934) internal successors, (368), 243 states have internal predecessors, (368), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 19:49:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 592 transitions. [2025-03-03 19:49:58,845 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 592 transitions. Word has length 476 [2025-03-03 19:49:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:58,847 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 592 transitions. [2025-03-03 19:49:58,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 592 transitions. [2025-03-03 19:49:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-03 19:49:58,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:58,850 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:49:58,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:58,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1819201403, now seen corresponding path program 1 times [2025-03-03 19:49:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789394405] [2025-03-03 19:49:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:58,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-03 19:49:58,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-03 19:49:58,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:49:59,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789394405] [2025-03-03 19:49:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789394405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786384302] [2025-03-03 19:49:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:59,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:59,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:59,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:59,295 INFO L87 Difference]: Start difference. First operand 357 states and 592 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:59,574 INFO L93 Difference]: Finished difference Result 949 states and 1570 transitions. [2025-03-03 19:49:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:59,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-03-03 19:49:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:59,580 INFO L225 Difference]: With dead ends: 949 [2025-03-03 19:49:59,580 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 19:49:59,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 19:49:59,582 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 200 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:59,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1069 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:49:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 19:49:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 591. [2025-03-03 19:49:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 404 states have (on average 1.5148514851485149) internal successors, (612), 407 states have internal predecessors, (612), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-03 19:49:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 976 transitions. [2025-03-03 19:49:59,668 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 976 transitions. Word has length 476 [2025-03-03 19:49:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:59,669 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 976 transitions. [2025-03-03 19:49:59,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:49:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 976 transitions. [2025-03-03 19:49:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 19:49:59,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:59,674 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:49:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:49:59,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:59,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1726687521, now seen corresponding path program 1 times [2025-03-03 19:49:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:59,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965087958] [2025-03-03 19:49:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:59,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 19:49:59,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 19:49:59,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:59,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965087958] [2025-03-03 19:50:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965087958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:00,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:50:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814741272] [2025-03-03 19:50:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:00,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:50:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:00,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:50:00,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:50:00,521 INFO L87 Difference]: Start difference. First operand 591 states and 976 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:01,680 INFO L93 Difference]: Finished difference Result 1747 states and 2843 transitions. [2025-03-03 19:50:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:50:01,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-03-03 19:50:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:01,690 INFO L225 Difference]: With dead ends: 1747 [2025-03-03 19:50:01,690 INFO L226 Difference]: Without dead ends: 1159 [2025-03-03 19:50:01,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:50:01,694 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 446 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:01,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1903 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:50:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-03 19:50:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 633. [2025-03-03 19:50:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 442 states have (on average 1.497737556561086) internal successors, (662), 445 states have internal predecessors, (662), 182 states have call successors, (182), 8 states have call predecessors, (182), 8 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-03 19:50:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1026 transitions. [2025-03-03 19:50:01,777 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1026 transitions. Word has length 477 [2025-03-03 19:50:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:01,778 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1026 transitions. [2025-03-03 19:50:01,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1026 transitions. [2025-03-03 19:50:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 19:50:01,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:01,781 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:01,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:50:01,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:01,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1106699776, now seen corresponding path program 1 times [2025-03-03 19:50:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345790645] [2025-03-03 19:50:01,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:01,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 19:50:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 19:50:01,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345790645] [2025-03-03 19:50:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345790645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:02,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:50:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008361189] [2025-03-03 19:50:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:50:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:02,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:50:02,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:50:02,312 INFO L87 Difference]: Start difference. First operand 633 states and 1026 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:03,512 INFO L93 Difference]: Finished difference Result 3008 states and 4864 transitions. [2025-03-03 19:50:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:50:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-03-03 19:50:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:03,525 INFO L225 Difference]: With dead ends: 3008 [2025-03-03 19:50:03,525 INFO L226 Difference]: Without dead ends: 2378 [2025-03-03 19:50:03,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:50:03,529 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 964 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:03,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1732 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:50:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2025-03-03 19:50:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2362. [2025-03-03 19:50:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 1638 states have (on average 1.4908424908424909) internal successors, (2442), 1653 states have internal predecessors, (2442), 686 states have call successors, (686), 37 states have call predecessors, (686), 37 states have return successors, (686), 671 states have call predecessors, (686), 686 states have call successors, (686) [2025-03-03 19:50:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3814 transitions. [2025-03-03 19:50:03,724 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3814 transitions. Word has length 477 [2025-03-03 19:50:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:03,726 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 3814 transitions. [2025-03-03 19:50:03,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3814 transitions. [2025-03-03 19:50:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 19:50:03,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:03,730 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:03,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:50:03,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:03,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash 983687543, now seen corresponding path program 1 times [2025-03-03 19:50:03,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:03,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489642111] [2025-03-03 19:50:03,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:03,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 19:50:03,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 19:50:03,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:03,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489642111] [2025-03-03 19:50:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489642111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:04,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:50:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621705936] [2025-03-03 19:50:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:04,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:50:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:04,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:50:04,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:50:04,063 INFO L87 Difference]: Start difference. First operand 2362 states and 3814 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:04,397 INFO L93 Difference]: Finished difference Result 5811 states and 9366 transitions. [2025-03-03 19:50:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:50:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-03-03 19:50:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:04,417 INFO L225 Difference]: With dead ends: 5811 [2025-03-03 19:50:04,418 INFO L226 Difference]: Without dead ends: 3510 [2025-03-03 19:50:04,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:50:04,424 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 515 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:04,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1906 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:50:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2025-03-03 19:50:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3477. [2025-03-03 19:50:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 2444 states have (on average 1.4885433715220948) internal successors, (3638), 2467 states have internal predecessors, (3638), 975 states have call successors, (975), 57 states have call predecessors, (975), 57 states have return successors, (975), 952 states have call predecessors, (975), 975 states have call successors, (975) [2025-03-03 19:50:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5588 transitions. [2025-03-03 19:50:04,691 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5588 transitions. Word has length 477 [2025-03-03 19:50:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:04,693 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5588 transitions. [2025-03-03 19:50:04,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5588 transitions. [2025-03-03 19:50:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:50:04,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:04,697 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:04,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:50:04,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1069630629, now seen corresponding path program 1 times [2025-03-03 19:50:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355291153] [2025-03-03 19:50:04,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:04,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:50:04,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:50:04,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:04,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355291153] [2025-03-03 19:50:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355291153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:04,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:50:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931750790] [2025-03-03 19:50:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:04,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:50:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:04,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:50:04,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:50:04,889 INFO L87 Difference]: Start difference. First operand 3477 states and 5588 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:05,658 INFO L93 Difference]: Finished difference Result 11137 states and 17937 transitions. [2025-03-03 19:50:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:50:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-03 19:50:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:05,697 INFO L225 Difference]: With dead ends: 11137 [2025-03-03 19:50:05,697 INFO L226 Difference]: Without dead ends: 7721 [2025-03-03 19:50:05,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 19:50:05,709 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 631 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:05,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1507 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:50:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7721 states. [2025-03-03 19:50:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7721 to 7695. [2025-03-03 19:50:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7695 states, 5390 states have (on average 1.4849721706864565) internal successors, (8004), 5445 states have internal predecessors, (8004), 2181 states have call successors, (2181), 123 states have call predecessors, (2181), 123 states have return successors, (2181), 2126 states have call predecessors, (2181), 2181 states have call successors, (2181) [2025-03-03 19:50:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7695 states to 7695 states and 12366 transitions. [2025-03-03 19:50:06,284 INFO L78 Accepts]: Start accepts. Automaton has 7695 states and 12366 transitions. Word has length 478 [2025-03-03 19:50:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:06,284 INFO L471 AbstractCegarLoop]: Abstraction has 7695 states and 12366 transitions. [2025-03-03 19:50:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 7695 states and 12366 transitions. [2025-03-03 19:50:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:50:06,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:06,291 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:06,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:50:06,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:06,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1134949348, now seen corresponding path program 1 times [2025-03-03 19:50:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:06,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840062690] [2025-03-03 19:50:06,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:06,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:50:06,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:50:06,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840062690] [2025-03-03 19:50:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840062690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:50:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47801355] [2025-03-03 19:50:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:06,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:50:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:06,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:50:06,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:50:06,461 INFO L87 Difference]: Start difference. First operand 7695 states and 12366 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:07,275 INFO L93 Difference]: Finished difference Result 15365 states and 24706 transitions. [2025-03-03 19:50:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:50:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-03 19:50:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:07,326 INFO L225 Difference]: With dead ends: 15365 [2025-03-03 19:50:07,329 INFO L226 Difference]: Without dead ends: 7731 [2025-03-03 19:50:07,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:50:07,353 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 229 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:07,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1000 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:50:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2025-03-03 19:50:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 7727. [2025-03-03 19:50:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7727 states, 5422 states have (on average 1.482109922537809) internal successors, (8036), 5477 states have internal predecessors, (8036), 2181 states have call successors, (2181), 123 states have call predecessors, (2181), 123 states have return successors, (2181), 2126 states have call predecessors, (2181), 2181 states have call successors, (2181) [2025-03-03 19:50:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7727 states to 7727 states and 12398 transitions. [2025-03-03 19:50:07,900 INFO L78 Accepts]: Start accepts. Automaton has 7727 states and 12398 transitions. Word has length 478 [2025-03-03 19:50:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:07,901 INFO L471 AbstractCegarLoop]: Abstraction has 7727 states and 12398 transitions. [2025-03-03 19:50:07,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7727 states and 12398 transitions. [2025-03-03 19:50:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:50:07,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:07,941 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:07,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:50:07,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:07,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 218360349, now seen corresponding path program 1 times [2025-03-03 19:50:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12957480] [2025-03-03 19:50:07,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:07,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:50:07,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:50:07,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:07,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:08,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:08,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12957480] [2025-03-03 19:50:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12957480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:50:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635425958] [2025-03-03 19:50:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:50:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:08,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:50:08,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:50:08,247 INFO L87 Difference]: Start difference. First operand 7727 states and 12398 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:09,178 INFO L93 Difference]: Finished difference Result 13239 states and 21258 transitions. [2025-03-03 19:50:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:50:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-03 19:50:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:09,210 INFO L225 Difference]: With dead ends: 13239 [2025-03-03 19:50:09,210 INFO L226 Difference]: Without dead ends: 5573 [2025-03-03 19:50:09,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03 19:50:09,232 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 758 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:09,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 780 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:50:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2025-03-03 19:50:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5569. [2025-03-03 19:50:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5569 states, 3926 states have (on average 1.4865002547121753) internal successors, (5836), 3965 states have internal predecessors, (5836), 1553 states have call successors, (1553), 89 states have call predecessors, (1553), 89 states have return successors, (1553), 1514 states have call predecessors, (1553), 1553 states have call successors, (1553) [2025-03-03 19:50:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8942 transitions. [2025-03-03 19:50:09,774 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 8942 transitions. Word has length 478 [2025-03-03 19:50:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:09,775 INFO L471 AbstractCegarLoop]: Abstraction has 5569 states and 8942 transitions. [2025-03-03 19:50:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 8942 transitions. [2025-03-03 19:50:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:50:09,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:09,784 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:50:09,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:09,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1747953723, now seen corresponding path program 1 times [2025-03-03 19:50:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873764550] [2025-03-03 19:50:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:50:09,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:50:09,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:09,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:10,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:10,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873764550] [2025-03-03 19:50:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873764550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:10,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:50:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933138584] [2025-03-03 19:50:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:50:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:10,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:50:10,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:50:10,232 INFO L87 Difference]: Start difference. First operand 5569 states and 8942 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:11,651 INFO L93 Difference]: Finished difference Result 23856 states and 38465 transitions. [2025-03-03 19:50:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:50:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-03 19:50:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:11,710 INFO L225 Difference]: With dead ends: 23856 [2025-03-03 19:50:11,710 INFO L226 Difference]: Without dead ends: 18348 [2025-03-03 19:50:11,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:50:11,727 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 843 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:11,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1532 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:50:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18348 states. [2025-03-03 19:50:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18348 to 9269. [2025-03-03 19:50:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9269 states, 7060 states have (on average 1.553257790368272) internal successors, (10966), 7122 states have internal predecessors, (10966), 2096 states have call successors, (2096), 112 states have call predecessors, (2096), 112 states have return successors, (2096), 2034 states have call predecessors, (2096), 2096 states have call successors, (2096) [2025-03-03 19:50:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9269 states to 9269 states and 15158 transitions. [2025-03-03 19:50:12,470 INFO L78 Accepts]: Start accepts. Automaton has 9269 states and 15158 transitions. Word has length 478 [2025-03-03 19:50:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:12,471 INFO L471 AbstractCegarLoop]: Abstraction has 9269 states and 15158 transitions. [2025-03-03 19:50:12,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 9269 states and 15158 transitions. [2025-03-03 19:50:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:50:12,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:12,478 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:12,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:50:12,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1507413594, now seen corresponding path program 1 times [2025-03-03 19:50:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:12,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683417112] [2025-03-03 19:50:12,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:12,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:50:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:50:12,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:12,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:50:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683417112] [2025-03-03 19:50:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683417112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:30,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:50:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80039794] [2025-03-03 19:50:30,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:30,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:50:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:50:30,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:50:30,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:50:30,189 INFO L87 Difference]: Start difference. First operand 9269 states and 15158 transitions. Second operand has 15 states, 15 states have (on average 7.4) internal successors, (111), 15 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:31,972 INFO L93 Difference]: Finished difference Result 25009 states and 39790 transitions. [2025-03-03 19:50:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:50:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.4) internal successors, (111), 15 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-03 19:50:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:32,023 INFO L225 Difference]: With dead ends: 25009 [2025-03-03 19:50:32,023 INFO L226 Difference]: Without dead ends: 15743 [2025-03-03 19:50:32,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:50:32,043 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 229 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:32,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1773 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:50:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15743 states. [2025-03-03 19:50:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15743 to 12213. [2025-03-03 19:50:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12213 states, 9684 states have (on average 1.5223048327137547) internal successors, (14742), 9810 states have internal predecessors, (14742), 2352 states have call successors, (2352), 176 states have call predecessors, (2352), 176 states have return successors, (2352), 2226 states have call predecessors, (2352), 2352 states have call successors, (2352) [2025-03-03 19:50:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12213 states to 12213 states and 19446 transitions. [2025-03-03 19:50:32,958 INFO L78 Accepts]: Start accepts. Automaton has 12213 states and 19446 transitions. Word has length 478 [2025-03-03 19:50:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 12213 states and 19446 transitions. [2025-03-03 19:50:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.4) internal successors, (111), 15 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:50:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 12213 states and 19446 transitions. [2025-03-03 19:50:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:50:32,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:32,969 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:50:32,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:50:32,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:32,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1506490073, now seen corresponding path program 1 times [2025-03-03 19:50:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:32,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914230653] [2025-03-03 19:50:32,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:32,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:50:33,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:50:33,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:33,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:51:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:51:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914230653] [2025-03-03 19:51:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914230653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:51:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:51:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:51:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870014836] [2025-03-03 19:51:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:51:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:51:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:51:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:51:04,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:51:04,734 INFO L87 Difference]: Start difference. First operand 12213 states and 19446 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:51:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:51:09,072 INFO L93 Difference]: Finished difference Result 14719 states and 22907 transitions. [2025-03-03 19:51:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:51:09,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-03-03 19:51:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:51:09,111 INFO L225 Difference]: With dead ends: 14719 [2025-03-03 19:51:09,111 INFO L226 Difference]: Without dead ends: 14717 [2025-03-03 19:51:09,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-03 19:51:09,115 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 132 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:51:09,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2637 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 19:51:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14717 states. [2025-03-03 19:51:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14717 to 12213. [2025-03-03 19:51:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12213 states, 9684 states have (on average 1.5223048327137547) internal successors, (14742), 9810 states have internal predecessors, (14742), 2352 states have call successors, (2352), 176 states have call predecessors, (2352), 176 states have return successors, (2352), 2226 states have call predecessors, (2352), 2352 states have call successors, (2352) [2025-03-03 19:51:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12213 states to 12213 states and 19446 transitions. [2025-03-03 19:51:10,049 INFO L78 Accepts]: Start accepts. Automaton has 12213 states and 19446 transitions. Word has length 478 [2025-03-03 19:51:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:51:10,050 INFO L471 AbstractCegarLoop]: Abstraction has 12213 states and 19446 transitions. [2025-03-03 19:51:10,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:51:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 12213 states and 19446 transitions. [2025-03-03 19:51:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-03 19:51:10,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:51:10,058 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:51:10,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:51:10,059 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:51:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:51:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 980099239, now seen corresponding path program 1 times [2025-03-03 19:51:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:51:10,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027872234] [2025-03-03 19:51:10,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:51:10,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-03 19:51:10,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-03 19:51:10,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:10,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat