./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b329d9832ec99d9ffbb7796b225f0eac74b08ac18938b07d93f1b80cf8ae2f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:10:27,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:10:27,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:10:27,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:10:27,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:10:27,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:10:27,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:10:27,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:10:27,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:10:27,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:10:27,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:10:27,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:10:27,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:10:27,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:10:27,232 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:10:27,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:10:27,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:10:27,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:10:27,234 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:10:27,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:10:27,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:10:27,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:10:27,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:10:27,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:10:27,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:10:27,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:10:27,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:10:27,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:10:27,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:10:27,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:10:27,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:10:27,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:10:27,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:10:27,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:10:27,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b329d9832ec99d9ffbb7796b225f0eac74b08ac18938b07d93f1b80cf8ae2f9 [2025-02-05 21:10:27,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:10:27,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:10:27,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:10:27,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:10:27,514 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:10:27,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i [2025-02-05 21:10:28,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2dc1696/6c916b3763004d8eb8b8c6e36d18ef22/FLAGc43822918 [2025-02-05 21:10:28,957 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:10:28,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i [2025-02-05 21:10:28,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2dc1696/6c916b3763004d8eb8b8c6e36d18ef22/FLAGc43822918 [2025-02-05 21:10:29,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2dc1696/6c916b3763004d8eb8b8c6e36d18ef22 [2025-02-05 21:10:29,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:10:29,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:10:29,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:10:29,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:10:29,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:10:29,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44984b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29, skipping insertion in model container [2025-02-05 21:10:29,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:10:29,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i[916,929] [2025-02-05 21:10:29,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:10:29,477 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:10:29,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-34.i[916,929] [2025-02-05 21:10:29,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:10:29,548 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:10:29,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29 WrapperNode [2025-02-05 21:10:29,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:10:29,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:10:29,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:10:29,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:10:29,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,588 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-02-05 21:10:29,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:10:29,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:10:29,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:10:29,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:10:29,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:10:29,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:10:29,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:10:29,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:10:29,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:10:29,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (1/1) ... [2025-02-05 21:10:29,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:10:29,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:29,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:10:29,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:10:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:10:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:10:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:10:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:10:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:10:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:10:29,775 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:10:29,776 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:10:30,155 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: havoc property_#t~bitwise30#1;havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~short33#1; [2025-02-05 21:10:30,196 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 21:10:30,197 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:10:30,221 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:10:30,223 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:10:30,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:10:30 BoogieIcfgContainer [2025-02-05 21:10:30,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:10:30,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:10:30,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:10:30,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:10:30,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:10:29" (1/3) ... [2025-02-05 21:10:30,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bcb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:10:30, skipping insertion in model container [2025-02-05 21:10:30,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:10:29" (2/3) ... [2025-02-05 21:10:30,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bcb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:10:30, skipping insertion in model container [2025-02-05 21:10:30,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:10:30" (3/3) ... [2025-02-05 21:10:30,232 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-34.i [2025-02-05 21:10:30,245 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:10:30,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-34.i that has 2 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:10:30,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:10:30,292 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;@56fe39e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:10:30,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:10:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 21:10:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 21:10:30,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:30,307 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:10:30,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:30,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 518691916, now seen corresponding path program 1 times [2025-02-05 21:10:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33234859] [2025-02-05 21:10:30,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 21:10:30,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 21:10:30,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:30,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-02-05 21:10:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33234859] [2025-02-05 21:10:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33234859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:10:30,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063879737] [2025-02-05 21:10:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:30,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:10:30,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:10:30,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:10:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:10:30,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 21:10:30,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 21:10:30,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:10:30,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:10:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-02-05 21:10:30,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:10:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063879737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:10:30,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:10:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211029155] [2025-02-05 21:10:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:30,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:10:30,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:30,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:10:30,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:10:30,901 INFO L87 Difference]: Start difference. First operand has 136 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-05 21:10:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:30,941 INFO L93 Difference]: Finished difference Result 266 states and 477 transitions. [2025-02-05 21:10:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:10:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 276 [2025-02-05 21:10:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:30,948 INFO L225 Difference]: With dead ends: 266 [2025-02-05 21:10:30,949 INFO L226 Difference]: Without dead ends: 133 [2025-02-05 21:10:30,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:10:30,956 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:30,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:10:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-05 21:10:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-05 21:10:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 21:10:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 214 transitions. [2025-02-05 21:10:30,997 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 214 transitions. Word has length 276 [2025-02-05 21:10:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:30,998 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 214 transitions. [2025-02-05 21:10:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-02-05 21:10:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 214 transitions. [2025-02-05 21:10:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 21:10:31,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:31,005 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:10:31,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:10:31,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:10:31,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:31,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash -344466808, now seen corresponding path program 1 times [2025-02-05 21:10:31,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:31,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813944696] [2025-02-05 21:10:31,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:31,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:31,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 21:10:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 21:10:31,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:31,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:10:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813944696] [2025-02-05 21:10:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813944696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:31,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:10:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294275964] [2025-02-05 21:10:31,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:31,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:10:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:31,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:10:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:10:31,829 INFO L87 Difference]: Start difference. First operand 133 states and 214 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:32,057 INFO L93 Difference]: Finished difference Result 423 states and 681 transitions. [2025-02-05 21:10:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:10:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 276 [2025-02-05 21:10:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:32,060 INFO L225 Difference]: With dead ends: 423 [2025-02-05 21:10:32,061 INFO L226 Difference]: Without dead ends: 293 [2025-02-05 21:10:32,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 21:10:32,062 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 204 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:32,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 646 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:10:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-05 21:10:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 263. [2025-02-05 21:10:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 172 states have (on average 1.447674418604651) internal successors, (249), 172 states have internal predecessors, (249), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 21:10:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 425 transitions. [2025-02-05 21:10:32,093 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 425 transitions. Word has length 276 [2025-02-05 21:10:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:32,094 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 425 transitions. [2025-02-05 21:10:32,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 425 transitions. [2025-02-05 21:10:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-02-05 21:10:32,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:32,097 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:10:32,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:10:32,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:32,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:32,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1349596759, now seen corresponding path program 1 times [2025-02-05 21:10:32,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:32,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635888429] [2025-02-05 21:10:32,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:32,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-02-05 21:10:32,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-02-05 21:10:32,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:32,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:10:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635888429] [2025-02-05 21:10:32,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635888429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:32,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:32,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:10:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189754655] [2025-02-05 21:10:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:32,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:10:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:32,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:10:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:10:32,403 INFO L87 Difference]: Start difference. First operand 263 states and 425 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:32,793 INFO L93 Difference]: Finished difference Result 778 states and 1258 transitions. [2025-02-05 21:10:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:10:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 277 [2025-02-05 21:10:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:32,797 INFO L225 Difference]: With dead ends: 778 [2025-02-05 21:10:32,797 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 21:10:32,798 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-02-05 21:10:32,798 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 240 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:32,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 825 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:10:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 21:10:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 267. [2025-02-05 21:10:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 176 states have (on average 1.4375) internal successors, (253), 176 states have internal predecessors, (253), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 21:10:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 429 transitions. [2025-02-05 21:10:32,867 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 429 transitions. Word has length 277 [2025-02-05 21:10:32,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:32,871 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 429 transitions. [2025-02-05 21:10:32,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 429 transitions. [2025-02-05 21:10:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 21:10:32,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:32,877 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:10:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:10:32,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:32,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1050038780, now seen corresponding path program 1 times [2025-02-05 21:10:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103662756] [2025-02-05 21:10:32,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:32,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 21:10:33,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 21:10:33,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:33,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:10:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103662756] [2025-02-05 21:10:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103662756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:10:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508160187] [2025-02-05 21:10:33,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:33,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:10:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:33,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:10:33,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:10:33,626 INFO L87 Difference]: Start difference. First operand 267 states and 429 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:33,999 INFO L93 Difference]: Finished difference Result 694 states and 1112 transitions. [2025-02-05 21:10:34,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:10:34,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-02-05 21:10:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:34,005 INFO L225 Difference]: With dead ends: 694 [2025-02-05 21:10:34,005 INFO L226 Difference]: Without dead ends: 430 [2025-02-05 21:10:34,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 21:10:34,007 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 157 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:34,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 567 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:10:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-05 21:10:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 374. [2025-02-05 21:10:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 238 states have (on average 1.4243697478991597) internal successors, (339), 238 states have internal predecessors, (339), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:10:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 603 transitions. [2025-02-05 21:10:34,076 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 603 transitions. Word has length 278 [2025-02-05 21:10:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:34,077 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 603 transitions. [2025-02-05 21:10:34,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 603 transitions. [2025-02-05 21:10:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 21:10:34,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:34,081 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:10:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:10:34,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -544480155, now seen corresponding path program 1 times [2025-02-05 21:10:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935180130] [2025-02-05 21:10:34,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:34,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 21:10:34,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 21:10:34,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:10:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:10:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:10:36,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935180130] [2025-02-05 21:10:36,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935180130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:10:36,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:10:36,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:10:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486741283] [2025-02-05 21:10:36,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:10:36,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:10:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:10:36,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:10:36,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:10:36,661 INFO L87 Difference]: Start difference. First operand 374 states and 603 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:10:37,210 INFO L93 Difference]: Finished difference Result 702 states and 1122 transitions. [2025-02-05 21:10:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:10:37,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-02-05 21:10:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:10:37,214 INFO L225 Difference]: With dead ends: 702 [2025-02-05 21:10:37,214 INFO L226 Difference]: Without dead ends: 438 [2025-02-05 21:10:37,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:10:37,216 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 223 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:10:37,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 677 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:10:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-02-05 21:10:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 380. [2025-02-05 21:10:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 244 states have (on average 1.4221311475409837) internal successors, (347), 244 states have internal predecessors, (347), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:10:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 611 transitions. [2025-02-05 21:10:37,269 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 611 transitions. Word has length 278 [2025-02-05 21:10:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:10:37,270 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 611 transitions. [2025-02-05 21:10:37,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:10:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 611 transitions. [2025-02-05 21:10:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 21:10:37,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:10:37,273 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:10:37,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:10:37,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:10:37,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:10:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2094054848, now seen corresponding path program 1 times [2025-02-05 21:10:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:10:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261502167] [2025-02-05 21:10:37,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:10:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:10:37,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 21:10:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 21:10:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:10:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:11:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261502167] [2025-02-05 21:11:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261502167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 21:11:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657481140] [2025-02-05 21:11:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:11:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:09,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:11:09,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:11:09,054 INFO L87 Difference]: Start difference. First operand 380 states and 611 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:12,910 INFO L93 Difference]: Finished difference Result 852 states and 1323 transitions. [2025-02-05 21:11:12,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:11:12,913 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-02-05 21:11:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:12,916 INFO L225 Difference]: With dead ends: 852 [2025-02-05 21:11:12,917 INFO L226 Difference]: Without dead ends: 571 [2025-02-05 21:11:12,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-02-05 21:11:12,918 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 594 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:12,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1742 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:11:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-05 21:11:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 446. [2025-02-05 21:11:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 310 states have internal predecessors, (439), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:11:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 703 transitions. [2025-02-05 21:11:12,972 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 703 transitions. Word has length 278 [2025-02-05 21:11:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:12,972 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 703 transitions. [2025-02-05 21:11:12,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 703 transitions. [2025-02-05 21:11:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 21:11:12,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:12,977 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:11:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:11:12,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:12,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1206551167, now seen corresponding path program 1 times [2025-02-05 21:11:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322418716] [2025-02-05 21:11:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:12,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 21:11:13,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 21:11:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:13,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:11:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:14,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322418716] [2025-02-05 21:11:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322418716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:14,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:11:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633857763] [2025-02-05 21:11:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:14,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:11:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:11:14,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:11:14,754 INFO L87 Difference]: Start difference. First operand 446 states and 703 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:15,923 INFO L93 Difference]: Finished difference Result 881 states and 1375 transitions. [2025-02-05 21:11:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:11:15,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-02-05 21:11:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:15,929 INFO L225 Difference]: With dead ends: 881 [2025-02-05 21:11:15,929 INFO L226 Difference]: Without dead ends: 601 [2025-02-05 21:11:15,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:11:15,933 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 407 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:15,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 897 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:11:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-05 21:11:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 487. [2025-02-05 21:11:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 351 states have (on average 1.4017094017094016) internal successors, (492), 351 states have internal predecessors, (492), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:11:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 756 transitions. [2025-02-05 21:11:15,989 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 756 transitions. Word has length 278 [2025-02-05 21:11:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:15,990 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 756 transitions. [2025-02-05 21:11:15,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 756 transitions. [2025-02-05 21:11:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 21:11:15,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:15,992 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:11:15,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:11:15,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 393457985, now seen corresponding path program 1 times [2025-02-05 21:11:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225393068] [2025-02-05 21:11:15,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:16,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 21:11:16,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 21:11:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:16,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:11:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225393068] [2025-02-05 21:11:20,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225393068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:20,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:20,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:11:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982427681] [2025-02-05 21:11:20,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:11:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:20,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:11:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:11:20,847 INFO L87 Difference]: Start difference. First operand 487 states and 756 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:21,989 INFO L93 Difference]: Finished difference Result 881 states and 1358 transitions. [2025-02-05 21:11:21,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:11:21,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-02-05 21:11:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:21,996 INFO L225 Difference]: With dead ends: 881 [2025-02-05 21:11:21,996 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 21:11:21,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:11:21,997 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 326 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:21,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1156 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:11:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 21:11:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 496. [2025-02-05 21:11:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 360 states have (on average 1.4) internal successors, (504), 360 states have internal predecessors, (504), 132 states have call successors, (132), 3 states have call predecessors, (132), 3 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-05 21:11:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 768 transitions. [2025-02-05 21:11:22,041 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 768 transitions. Word has length 278 [2025-02-05 21:11:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:22,041 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 768 transitions. [2025-02-05 21:11:22,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 768 transitions. [2025-02-05 21:11:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 21:11:22,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:22,044 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:11:22,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:11:22,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:22,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1690378271, now seen corresponding path program 1 times [2025-02-05 21:11:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:22,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159727414] [2025-02-05 21:11:22,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:22,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:22,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 21:11:22,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 21:11:22,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:22,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:11:24,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159727414] [2025-02-05 21:11:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159727414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:11:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418577332] [2025-02-05 21:11:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:24,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:11:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:24,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:11:24,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:11:24,517 INFO L87 Difference]: Start difference. First operand 496 states and 768 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:27,199 INFO L93 Difference]: Finished difference Result 964 states and 1480 transitions. [2025-02-05 21:11:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:11:27,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 278 [2025-02-05 21:11:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:27,206 INFO L225 Difference]: With dead ends: 964 [2025-02-05 21:11:27,206 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 21:11:27,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:11:27,208 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 558 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:27,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 2061 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 21:11:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 21:11:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 667. [2025-02-05 21:11:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 486 states have (on average 1.3930041152263375) internal successors, (677), 486 states have internal predecessors, (677), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-05 21:11:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1029 transitions. [2025-02-05 21:11:27,270 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1029 transitions. Word has length 278 [2025-02-05 21:11:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:27,271 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 1029 transitions. [2025-02-05 21:11:27,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1029 transitions. [2025-02-05 21:11:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-05 21:11:27,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:27,273 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:11:27,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:11:27,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:27,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash -79780110, now seen corresponding path program 1 times [2025-02-05 21:11:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:27,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794017193] [2025-02-05 21:11:27,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:27,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 21:11:27,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 21:11:27,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:27,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:11:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-02-05 21:11:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:11:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794017193] [2025-02-05 21:11:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794017193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:11:43,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:11:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:11:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333253813] [2025-02-05 21:11:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:11:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:11:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:11:43,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:11:43,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:11:43,665 INFO L87 Difference]: Start difference. First operand 667 states and 1029 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:11:44,148 INFO L93 Difference]: Finished difference Result 1332 states and 2045 transitions. [2025-02-05 21:11:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:11:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 279 [2025-02-05 21:11:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:11:44,152 INFO L225 Difference]: With dead ends: 1332 [2025-02-05 21:11:44,152 INFO L226 Difference]: Without dead ends: 932 [2025-02-05 21:11:44,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:11:44,154 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 296 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:11:44,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1219 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:11:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-05 21:11:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 766. [2025-02-05 21:11:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 578 states have (on average 1.3944636678200693) internal successors, (806), 579 states have internal predecessors, (806), 181 states have call successors, (181), 6 states have call predecessors, (181), 6 states have return successors, (181), 180 states have call predecessors, (181), 181 states have call successors, (181) [2025-02-05 21:11:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1168 transitions. [2025-02-05 21:11:44,222 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1168 transitions. Word has length 279 [2025-02-05 21:11:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:11:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1168 transitions. [2025-02-05 21:11:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-05 21:11:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1168 transitions. [2025-02-05 21:11:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-05 21:11:44,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:11:44,225 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:11:44,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:11:44,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:11:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:11:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1273529587, now seen corresponding path program 1 times [2025-02-05 21:11:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:11:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130997586] [2025-02-05 21:11:44,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:11:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:11:44,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 21:11:44,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 21:11:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:11:44,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat