./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:06:52,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:06:52,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:06:52,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:06:52,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:06:52,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:06:52,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:06:52,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:06:52,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:06:52,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:06:52,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:06:52,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:06:52,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:52,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:06:52,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:06:52,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 [2025-03-17 00:06:52,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:06:52,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:06:52,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:06:52,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:06:52,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:06:52,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-03-17 00:06:53,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df2f1a89/b11b7847b24e4239a3b710691e8a57d2/FLAGe44cc338a [2025-03-17 00:06:53,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:06:53,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-03-17 00:06:53,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df2f1a89/b11b7847b24e4239a3b710691e8a57d2/FLAGe44cc338a [2025-03-17 00:06:54,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df2f1a89/b11b7847b24e4239a3b710691e8a57d2 [2025-03-17 00:06:54,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:06:54,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:06:54,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:54,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:06:54,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:06:54,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54, skipping insertion in model container [2025-03-17 00:06:54,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:06:54,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-03-17 00:06:54,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:54,294 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:06:54,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-03-17 00:06:54,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:54,389 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:06:54,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54 WrapperNode [2025-03-17 00:06:54,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:54,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:54,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:06:54,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:06:54,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,475 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-03-17 00:06:54,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:54,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:06:54,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:06:54,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:06:54,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,513 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:06:54,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:06:54,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:06:54,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:06:54,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:06:54,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (1/1) ... [2025-03-17 00:06:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:54,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:54,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:06:54,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:06:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:06:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:06:54,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:06:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:06:54,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:06:54,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:06:54,709 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:06:54,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:06:55,326 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 00:06:55,326 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:06:55,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:06:55,352 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:06:55,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:55 BoogieIcfgContainer [2025-03-17 00:06:55,352 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:06:55,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:06:55,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:06:55,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:06:55,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:06:54" (1/3) ... [2025-03-17 00:06:55,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155287a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:55, skipping insertion in model container [2025-03-17 00:06:55,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:54" (2/3) ... [2025-03-17 00:06:55,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155287a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:55, skipping insertion in model container [2025-03-17 00:06:55,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:55" (3/3) ... [2025-03-17 00:06:55,359 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-03-17 00:06:55,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:06:55,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i that has 2 procedures, 216 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:06:55,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:06:55,467 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;@6010d537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:06:55,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:06:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 139 states have internal predecessors, (217), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 00:06:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-17 00:06:55,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:55,501 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:55,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:55,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash 499512866, now seen corresponding path program 1 times [2025-03-17 00:06:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223584921] [2025-03-17 00:06:55,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:55,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 00:06:55,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 00:06:55,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-03-17 00:06:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223584921] [2025-03-17 00:06:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223584921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576906705] [2025-03-17 00:06:56,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:56,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:56,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:06:56,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:06:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 00:06:56,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 00:06:56,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:56,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:56,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:06:56,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-03-17 00:06:56,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:06:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576906705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:56,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:06:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:06:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942047197] [2025-03-17 00:06:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:56,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:06:56,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:56,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:06:56,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:06:56,423 INFO L87 Difference]: Start difference. First operand has 216 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 139 states have internal predecessors, (217), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-17 00:06:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:56,474 INFO L93 Difference]: Finished difference Result 429 states and 807 transitions. [2025-03-17 00:06:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:06:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 469 [2025-03-17 00:06:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:56,485 INFO L225 Difference]: With dead ends: 429 [2025-03-17 00:06:56,485 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 00:06:56,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:06:56,491 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:56,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 00:06:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-17 00:06:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 137 states have internal predecessors, (211), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 00:06:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 361 transitions. [2025-03-17 00:06:56,556 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 361 transitions. Word has length 469 [2025-03-17 00:06:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:56,557 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 361 transitions. [2025-03-17 00:06:56,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-17 00:06:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 361 transitions. [2025-03-17 00:06:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-17 00:06:56,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:56,569 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:56,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:06:56,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:06:56,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 837831973, now seen corresponding path program 1 times [2025-03-17 00:06:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818898137] [2025-03-17 00:06:56,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:56,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 00:06:56,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 00:06:56,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:56,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:06:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818898137] [2025-03-17 00:06:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818898137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585449998] [2025-03-17 00:06:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:57,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:57,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:57,141 INFO L87 Difference]: Start difference. First operand 214 states and 361 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:06:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:57,243 INFO L93 Difference]: Finished difference Result 580 states and 981 transitions. [2025-03-17 00:06:57,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 469 [2025-03-17 00:06:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:57,250 INFO L225 Difference]: With dead ends: 580 [2025-03-17 00:06:57,251 INFO L226 Difference]: Without dead ends: 367 [2025-03-17 00:06:57,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:57,252 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 251 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:57,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 692 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-17 00:06:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2025-03-17 00:06:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 248 states have (on average 1.5685483870967742) internal successors, (389), 249 states have internal predecessors, (389), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 00:06:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 615 transitions. [2025-03-17 00:06:57,308 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 615 transitions. Word has length 469 [2025-03-17 00:06:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:57,310 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 615 transitions. [2025-03-17 00:06:57,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:06:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 615 transitions. [2025-03-17 00:06:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-17 00:06:57,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:57,318 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:57,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:06:57,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:57,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash -862908506, now seen corresponding path program 1 times [2025-03-17 00:06:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:57,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392781859] [2025-03-17 00:06:57,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:57,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:57,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 00:06:57,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 00:06:57,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:06:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:57,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392781859] [2025-03-17 00:06:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392781859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:57,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:06:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457550962] [2025-03-17 00:06:57,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:06:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:58,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:06:58,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:06:58,002 INFO L87 Difference]: Start difference. First operand 364 states and 615 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:06:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:58,952 INFO L93 Difference]: Finished difference Result 1904 states and 3219 transitions. [2025-03-17 00:06:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:06:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 469 [2025-03-17 00:06:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:58,966 INFO L225 Difference]: With dead ends: 1904 [2025-03-17 00:06:58,966 INFO L226 Difference]: Without dead ends: 1541 [2025-03-17 00:06:58,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:58,969 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 984 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:58,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2741 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 00:06:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-03-17 00:06:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1523. [2025-03-17 00:06:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1074 states have (on average 1.585661080074488) internal successors, (1703), 1082 states have internal predecessors, (1703), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-17 00:06:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2579 transitions. [2025-03-17 00:06:59,134 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2579 transitions. Word has length 469 [2025-03-17 00:06:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 2579 transitions. [2025-03-17 00:06:59,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:06:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2579 transitions. [2025-03-17 00:06:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-17 00:06:59,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:59,144 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:06:59,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:06:59,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:59,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash -738835259, now seen corresponding path program 1 times [2025-03-17 00:06:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734960637] [2025-03-17 00:06:59,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:59,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-17 00:06:59,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-17 00:06:59,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:59,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:06:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734960637] [2025-03-17 00:06:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734960637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:59,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:06:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550023734] [2025-03-17 00:06:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:06:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:59,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:06:59,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:59,590 INFO L87 Difference]: Start difference. First operand 1523 states and 2579 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:00,405 INFO L93 Difference]: Finished difference Result 5649 states and 9509 transitions. [2025-03-17 00:07:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:07:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 469 [2025-03-17 00:07:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:00,434 INFO L225 Difference]: With dead ends: 5649 [2025-03-17 00:07:00,434 INFO L226 Difference]: Without dead ends: 4127 [2025-03-17 00:07:00,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:07:00,442 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 714 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:00,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1287 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:07:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2025-03-17 00:07:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 3032. [2025-03-17 00:07:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 2114 states have (on average 1.5657521286660359) internal successors, (3310), 2133 states have internal predecessors, (3310), 895 states have call successors, (895), 22 states have call predecessors, (895), 22 states have return successors, (895), 876 states have call predecessors, (895), 895 states have call successors, (895) [2025-03-17 00:07:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 5100 transitions. [2025-03-17 00:07:00,756 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 5100 transitions. Word has length 469 [2025-03-17 00:07:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:00,757 INFO L471 AbstractCegarLoop]: Abstraction has 3032 states and 5100 transitions. [2025-03-17 00:07:00,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 5100 transitions. [2025-03-17 00:07:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-17 00:07:00,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:00,764 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:07:00,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1054251986, now seen corresponding path program 1 times [2025-03-17 00:07:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982027982] [2025-03-17 00:07:00,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:00,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-17 00:07:00,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-17 00:07:00,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:00,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:07:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:01,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982027982] [2025-03-17 00:07:01,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982027982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:01,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:01,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:07:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862325643] [2025-03-17 00:07:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:07:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:01,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:07:01,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:07:01,319 INFO L87 Difference]: Start difference. First operand 3032 states and 5100 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:01,866 INFO L93 Difference]: Finished difference Result 7345 states and 12422 transitions. [2025-03-17 00:07:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:07:01,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 470 [2025-03-17 00:07:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:01,890 INFO L225 Difference]: With dead ends: 7345 [2025-03-17 00:07:01,891 INFO L226 Difference]: Without dead ends: 4314 [2025-03-17 00:07:01,902 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-03-17 00:07:01,902 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 322 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:01,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1045 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:07:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2025-03-17 00:07:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 3988. [2025-03-17 00:07:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 2992 states have (on average 1.6122994652406417) internal successors, (4824), 3011 states have internal predecessors, (4824), 970 states have call successors, (970), 25 states have call predecessors, (970), 25 states have return successors, (970), 951 states have call predecessors, (970), 970 states have call successors, (970) [2025-03-17 00:07:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 6764 transitions. [2025-03-17 00:07:02,199 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 6764 transitions. Word has length 470 [2025-03-17 00:07:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:02,200 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 6764 transitions. [2025-03-17 00:07:02,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 6764 transitions. [2025-03-17 00:07:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-17 00:07:02,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:02,206 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:07:02,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2024484111, now seen corresponding path program 1 times [2025-03-17 00:07:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655906268] [2025-03-17 00:07:02,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:02,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-17 00:07:02,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-17 00:07:02,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:02,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:07:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:02,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655906268] [2025-03-17 00:07:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655906268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:07:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044794267] [2025-03-17 00:07:02,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:02,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:07:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:02,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:07:02,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:07:02,788 INFO L87 Difference]: Start difference. First operand 3988 states and 6764 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:03,457 INFO L93 Difference]: Finished difference Result 10140 states and 17073 transitions. [2025-03-17 00:07:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:07:03,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 471 [2025-03-17 00:07:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:03,533 INFO L225 Difference]: With dead ends: 10140 [2025-03-17 00:07:03,533 INFO L226 Difference]: Without dead ends: 7109 [2025-03-17 00:07:03,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:07:03,543 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 332 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:03,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1252 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:07:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2025-03-17 00:07:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 7017. [2025-03-17 00:07:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7017 states, 5104 states have (on average 1.588949843260188) internal successors, (8110), 5142 states have internal predecessors, (8110), 1865 states have call successors, (1865), 47 states have call predecessors, (1865), 47 states have return successors, (1865), 1827 states have call predecessors, (1865), 1865 states have call successors, (1865) [2025-03-17 00:07:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7017 states to 7017 states and 11840 transitions. [2025-03-17 00:07:04,101 INFO L78 Accepts]: Start accepts. Automaton has 7017 states and 11840 transitions. Word has length 471 [2025-03-17 00:07:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:04,102 INFO L471 AbstractCegarLoop]: Abstraction has 7017 states and 11840 transitions. [2025-03-17 00:07:04,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7017 states and 11840 transitions. [2025-03-17 00:07:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-17 00:07:04,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:04,112 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:04,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:07:04,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash -100273230, now seen corresponding path program 1 times [2025-03-17 00:07:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039618917] [2025-03-17 00:07:04,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-17 00:07:04,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-17 00:07:04,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:04,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:07:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039618917] [2025-03-17 00:07:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039618917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:07:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194488947] [2025-03-17 00:07:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:07:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:04,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:07:04,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:07:04,477 INFO L87 Difference]: Start difference. First operand 7017 states and 11840 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-17 00:07:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:05,331 INFO L93 Difference]: Finished difference Result 19137 states and 32190 transitions. [2025-03-17 00:07:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 472 [2025-03-17 00:07:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:05,413 INFO L225 Difference]: With dead ends: 19137 [2025-03-17 00:07:05,414 INFO L226 Difference]: Without dead ends: 13077 [2025-03-17 00:07:05,444 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-03-17 00:07:05,445 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 327 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:05,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1028 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:07:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2025-03-17 00:07:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 13075. [2025-03-17 00:07:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13075 states, 9328 states have (on average 1.5716123499142367) internal successors, (14660), 9404 states have internal predecessors, (14660), 3655 states have call successors, (3655), 91 states have call predecessors, (3655), 91 states have return successors, (3655), 3579 states have call predecessors, (3655), 3655 states have call successors, (3655) [2025-03-17 00:07:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13075 states to 13075 states and 21970 transitions. [2025-03-17 00:07:06,623 INFO L78 Accepts]: Start accepts. Automaton has 13075 states and 21970 transitions. Word has length 472 [2025-03-17 00:07:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:06,625 INFO L471 AbstractCegarLoop]: Abstraction has 13075 states and 21970 transitions. [2025-03-17 00:07:06,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-17 00:07:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 13075 states and 21970 transitions. [2025-03-17 00:07:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-17 00:07:06,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:06,630 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:06,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:07:06,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:06,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1907727693, now seen corresponding path program 1 times [2025-03-17 00:07:06,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539360611] [2025-03-17 00:07:06,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:06,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-17 00:07:06,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-17 00:07:06,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:07:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539360611] [2025-03-17 00:07:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539360611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901375593] [2025-03-17 00:07:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:06,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:06,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:06,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:06,944 INFO L87 Difference]: Start difference. First operand 13075 states and 21970 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:07,705 INFO L93 Difference]: Finished difference Result 25413 states and 42649 transitions. [2025-03-17 00:07:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:07,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 472 [2025-03-17 00:07:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:07,780 INFO L225 Difference]: With dead ends: 25413 [2025-03-17 00:07:07,780 INFO L226 Difference]: Without dead ends: 13295 [2025-03-17 00:07:07,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:07,818 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 17 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:07,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 713 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13295 states. [2025-03-17 00:07:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13295 to 13075. [2025-03-17 00:07:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13075 states, 9328 states have (on average 1.5621783876500857) internal successors, (14572), 9404 states have internal predecessors, (14572), 3655 states have call successors, (3655), 91 states have call predecessors, (3655), 91 states have return successors, (3655), 3579 states have call predecessors, (3655), 3655 states have call successors, (3655) [2025-03-17 00:07:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13075 states to 13075 states and 21882 transitions. [2025-03-17 00:07:09,052 INFO L78 Accepts]: Start accepts. Automaton has 13075 states and 21882 transitions. Word has length 472 [2025-03-17 00:07:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:09,053 INFO L471 AbstractCegarLoop]: Abstraction has 13075 states and 21882 transitions. [2025-03-17 00:07:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13075 states and 21882 transitions. [2025-03-17 00:07:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-17 00:07:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:09,060 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:09,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:07:09,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1654765424, now seen corresponding path program 1 times [2025-03-17 00:07:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880159768] [2025-03-17 00:07:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:09,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:07:09,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:07:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-17 00:07:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880159768] [2025-03-17 00:07:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880159768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:09,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691535551] [2025-03-17 00:07:09,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:09,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:09,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:09,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:09,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:07:09,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:07:09,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:07:09,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:09,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:07:09,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 2202 proven. 198 refuted. 0 times theorem prover too weak. 8700 trivial. 0 not checked. [2025-03-17 00:07:10,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-17 00:07:10,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691535551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:10,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:10,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 00:07:10,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110286627] [2025-03-17 00:07:10,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:10,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:07:10,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:10,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:07:10,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:07:10,845 INFO L87 Difference]: Start difference. First operand 13075 states and 21882 transitions. Second operand has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-03-17 00:07:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:11,702 INFO L93 Difference]: Finished difference Result 19673 states and 32462 transitions. [2025-03-17 00:07:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:07:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) Word has length 473 [2025-03-17 00:07:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:11,772 INFO L225 Difference]: With dead ends: 19673 [2025-03-17 00:07:11,773 INFO L226 Difference]: Without dead ends: 13613 [2025-03-17 00:07:11,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:07:11,807 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 497 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:11,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 660 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:07:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13613 states. [2025-03-17 00:07:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13613 to 7197. [2025-03-17 00:07:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7197 states, 5239 states have (on average 1.5569765222370682) internal successors, (8157), 5277 states have internal predecessors, (8157), 1865 states have call successors, (1865), 92 states have call predecessors, (1865), 92 states have return successors, (1865), 1827 states have call predecessors, (1865), 1865 states have call successors, (1865) [2025-03-17 00:07:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 11887 transitions. [2025-03-17 00:07:12,570 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 11887 transitions. Word has length 473 [2025-03-17 00:07:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:12,571 INFO L471 AbstractCegarLoop]: Abstraction has 7197 states and 11887 transitions. [2025-03-17 00:07:12,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-03-17 00:07:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 11887 transitions. [2025-03-17 00:07:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-17 00:07:12,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:12,575 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:12,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:07:12,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 00:07:12,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:12,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash 832747409, now seen corresponding path program 1 times [2025-03-17 00:07:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:12,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156834660] [2025-03-17 00:07:12,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:12,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:07:12,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:07:12,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:12,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 54 proven. 168 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-17 00:07:13,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:13,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156834660] [2025-03-17 00:07:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156834660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355219010] [2025-03-17 00:07:13,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:13,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:13,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:13,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:13,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:07:13,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:07:13,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:07:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:13,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:07:13,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 4142 proven. 168 refuted. 0 times theorem prover too weak. 6790 trivial. 0 not checked. [2025-03-17 00:07:14,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 54 proven. 168 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-17 00:07:14,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355219010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:14,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:14,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-03-17 00:07:14,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334097318] [2025-03-17 00:07:14,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:07:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:14,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:07:14,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:07:14,534 INFO L87 Difference]: Start difference. First operand 7197 states and 11887 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-03-17 00:07:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:16,277 INFO L93 Difference]: Finished difference Result 16045 states and 25527 transitions. [2025-03-17 00:07:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 00:07:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) Word has length 473 [2025-03-17 00:07:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:16,340 INFO L225 Difference]: With dead ends: 16045 [2025-03-17 00:07:16,341 INFO L226 Difference]: Without dead ends: 12926 [2025-03-17 00:07:16,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 943 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:07:16,355 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 400 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:16,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2273 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:07:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12926 states. [2025-03-17 00:07:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12926 to 9181. [2025-03-17 00:07:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9181 states, 6342 states have (on average 1.467045096184169) internal successors, (9304), 6424 states have internal predecessors, (9304), 2613 states have call successors, (2613), 225 states have call predecessors, (2613), 225 states have return successors, (2613), 2531 states have call predecessors, (2613), 2613 states have call successors, (2613) [2025-03-17 00:07:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 14530 transitions. [2025-03-17 00:07:17,152 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 14530 transitions. Word has length 473 [2025-03-17 00:07:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:17,153 INFO L471 AbstractCegarLoop]: Abstraction has 9181 states and 14530 transitions. [2025-03-17 00:07:17,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-03-17 00:07:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 14530 transitions. [2025-03-17 00:07:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-17 00:07:17,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:17,157 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:17,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:07:17,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:17,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:17,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 48227795, now seen corresponding path program 1 times [2025-03-17 00:07:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346011200] [2025-03-17 00:07:17,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:17,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:07:17,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:07:17,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:17,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 276 proven. 162 refuted. 0 times theorem prover too weak. 10662 trivial. 0 not checked. [2025-03-17 00:07:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346011200] [2025-03-17 00:07:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346011200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:07:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45371371] [2025-03-17 00:07:18,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:07:18,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:07:18,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:07:18,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:07:18,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:07:18,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:18,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:18,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 00:07:18,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:07:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 5627 proven. 162 refuted. 0 times theorem prover too weak. 5311 trivial. 0 not checked. [2025-03-17 00:07:19,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:07:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 276 proven. 165 refuted. 0 times theorem prover too weak. 10659 trivial. 0 not checked. [2025-03-17 00:07:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45371371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:07:19,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:07:19,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2025-03-17 00:07:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582252261] [2025-03-17 00:07:19,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:07:19,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 00:07:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:19,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 00:07:19,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:07:19,868 INFO L87 Difference]: Start difference. First operand 9181 states and 14530 transitions. Second operand has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 18 states have internal predecessors, (150), 3 states have call successors, (104), 3 states have call predecessors, (104), 7 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106) [2025-03-17 00:07:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:29,287 INFO L93 Difference]: Finished difference Result 71961 states and 111162 transitions. [2025-03-17 00:07:29,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2025-03-17 00:07:29,287 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 18 states have internal predecessors, (150), 3 states have call successors, (104), 3 states have call predecessors, (104), 7 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106) Word has length 474 [2025-03-17 00:07:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:29,570 INFO L225 Difference]: With dead ends: 71961 [2025-03-17 00:07:29,570 INFO L226 Difference]: Without dead ends: 62973 [2025-03-17 00:07:29,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 953 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5725 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2487, Invalid=12519, Unknown=0, NotChecked=0, Total=15006 [2025-03-17 00:07:29,622 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 4315 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 3412 mSolverCounterSat, 1891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4363 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 5303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1891 IncrementalHoareTripleChecker+Valid, 3412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:29,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4363 Valid, 4097 Invalid, 5303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1891 Valid, 3412 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 00:07:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62973 states. [2025-03-17 00:07:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62973 to 30925. [2025-03-17 00:07:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30925 states, 21062 states have (on average 1.4294938752255246) internal successors, (30108), 21356 states have internal predecessors, (30108), 9021 states have call successors, (9021), 841 states have call predecessors, (9021), 841 states have return successors, (9021), 8727 states have call predecessors, (9021), 9021 states have call successors, (9021) [2025-03-17 00:07:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30925 states to 30925 states and 48150 transitions. [2025-03-17 00:07:33,998 INFO L78 Accepts]: Start accepts. Automaton has 30925 states and 48150 transitions. Word has length 474 [2025-03-17 00:07:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 30925 states and 48150 transitions. [2025-03-17 00:07:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 18 states have internal predecessors, (150), 3 states have call successors, (104), 3 states have call predecessors, (104), 7 states have return successors, (106), 3 states have call predecessors, (106), 3 states have call successors, (106) [2025-03-17 00:07:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 30925 states and 48150 transitions. [2025-03-17 00:07:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-17 00:07:34,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:34,007 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:34,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 00:07:34,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:07:34,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:34,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash -30830669, now seen corresponding path program 1 times [2025-03-17 00:07:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568691587] [2025-03-17 00:07:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:34,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:07:34,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:07:34,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:34,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:07:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568691587] [2025-03-17 00:07:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568691587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:34,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709178678] [2025-03-17 00:07:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:34,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:34,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:34,407 INFO L87 Difference]: Start difference. First operand 30925 states and 48150 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:40,165 INFO L93 Difference]: Finished difference Result 81357 states and 126310 transitions. [2025-03-17 00:07:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:40,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 474 [2025-03-17 00:07:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:40,386 INFO L225 Difference]: With dead ends: 81357 [2025-03-17 00:07:40,387 INFO L226 Difference]: Without dead ends: 52087 [2025-03-17 00:07:40,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:40,468 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 211 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:40,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 685 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52087 states. [2025-03-17 00:07:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52087 to 52085. [2025-03-17 00:07:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52085 states, 35212 states have (on average 1.4192320799727365) internal successors, (49974), 35718 states have internal predecessors, (49974), 15429 states have call successors, (15429), 1443 states have call predecessors, (15429), 1443 states have return successors, (15429), 14923 states have call predecessors, (15429), 15429 states have call successors, (15429) [2025-03-17 00:07:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52085 states to 52085 states and 80832 transitions. [2025-03-17 00:07:45,482 INFO L78 Accepts]: Start accepts. Automaton has 52085 states and 80832 transitions. Word has length 474 [2025-03-17 00:07:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:45,483 INFO L471 AbstractCegarLoop]: Abstraction has 52085 states and 80832 transitions. [2025-03-17 00:07:45,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 52085 states and 80832 transitions. [2025-03-17 00:07:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-17 00:07:45,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:45,492 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:45,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:07:45,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:45,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1271546305, now seen corresponding path program 1 times [2025-03-17 00:07:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966318240] [2025-03-17 00:07:45,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:07:45,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:07:45,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:45,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:07:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:07:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:07:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966318240] [2025-03-17 00:07:45,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966318240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:07:45,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:07:45,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:07:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607340362] [2025-03-17 00:07:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:07:45,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:07:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:07:45,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:07:45,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:45,606 INFO L87 Difference]: Start difference. First operand 52085 states and 80832 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:07:52,393 INFO L93 Difference]: Finished difference Result 112677 states and 173845 transitions. [2025-03-17 00:07:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:07:52,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 474 [2025-03-17 00:07:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:07:52,698 INFO L225 Difference]: With dead ends: 112677 [2025-03-17 00:07:52,699 INFO L226 Difference]: Without dead ends: 61545 [2025-03-17 00:07:52,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:07:52,840 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 235 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:07:52,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 695 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:07:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61545 states. [2025-03-17 00:07:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61545 to 61111. [2025-03-17 00:07:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61111 states, 40713 states have (on average 1.39785817797755) internal successors, (56911), 41315 states have internal predecessors, (56911), 18545 states have call successors, (18545), 1852 states have call predecessors, (18545), 1852 states have return successors, (18545), 17943 states have call predecessors, (18545), 18545 states have call successors, (18545) [2025-03-17 00:07:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61111 states to 61111 states and 94001 transitions. [2025-03-17 00:07:58,857 INFO L78 Accepts]: Start accepts. Automaton has 61111 states and 94001 transitions. Word has length 474 [2025-03-17 00:07:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:07:58,858 INFO L471 AbstractCegarLoop]: Abstraction has 61111 states and 94001 transitions. [2025-03-17 00:07:58,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-17 00:07:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 61111 states and 94001 transitions. [2025-03-17 00:07:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-17 00:07:58,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:07:58,867 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:07:58,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:07:58,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:07:58,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:07:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash 907523281, now seen corresponding path program 1 times [2025-03-17 00:07:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:07:58,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433582178] [2025-03-17 00:07:58,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:07:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:07:58,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:07:58,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:07:58,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:07:58,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-17 00:08:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433582178] [2025-03-17 00:08:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433582178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:00,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:08:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56717335] [2025-03-17 00:08:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:00,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:08:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:00,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:08:00,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:08:00,074 INFO L87 Difference]: Start difference. First operand 61111 states and 94001 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75)