./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.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_loopvsstraightlinecode_100-1loop_file-68.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 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:08:27,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:08:27,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:08:27,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:08:27,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:08:27,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:08:27,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:08:27,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:08:27,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:08:27,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:08:27,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:08:27,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:08:27,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:08:27,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:08:27,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:08:27,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:08:27,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:08:27,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:08:27,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:08:27,953 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 -> 7af22c4985483bd6c8caf866cf1f41c10246f5959d956f77eec260fff7ae1f47 [2025-03-17 03:08:28,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:08:28,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:08:28,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:08:28,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:08:28,218 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:08:28,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-03-17 03:08:29,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac8c0cc/35da18a693d145a5910cc9acf43363ae/FLAG4068a6dea [2025-03-17 03:08:29,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:08:29,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-03-17 03:08:29,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac8c0cc/35da18a693d145a5910cc9acf43363ae/FLAG4068a6dea [2025-03-17 03:08:29,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ac8c0cc/35da18a693d145a5910cc9acf43363ae [2025-03-17 03:08:29,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:08:29,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:08:29,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:08:29,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:08:29,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:08:29,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:29" (1/1) ... [2025-03-17 03:08:29,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:29, skipping insertion in model container [2025-03-17 03:08:29,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:29" (1/1) ... [2025-03-17 03:08:30,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:08:30,094 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-03-17 03:08:30,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:08:30,163 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:08:30,170 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_loopvsstraightlinecode_100-1loop_file-68.i[916,929] [2025-03-17 03:08:30,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:08:30,221 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:08:30,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30 WrapperNode [2025-03-17 03:08:30,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:08:30,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:08:30,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:08:30,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:08:30,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,276 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2025-03-17 03:08:30,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:08:30,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:08:30,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:08:30,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:08:30,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,311 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 03:08:30,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:08:30,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:08:30,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:08:30,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:08:30,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (1/1) ... [2025-03-17 03:08:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:08:30,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:30,375 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 03:08:30,381 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 03:08:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:08:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:08:30,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:08:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:08:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:08:30,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:08:30,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:08:30,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:08:30,979 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-17 03:08:31,048 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-17 03:08:31,048 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:08:31,075 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:08:31,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:08:31,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:31 BoogieIcfgContainer [2025-03-17 03:08:31,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:08:31,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:08:31,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:08:31,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:08:31,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:08:29" (1/3) ... [2025-03-17 03:08:31,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af8d0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:08:31, skipping insertion in model container [2025-03-17 03:08:31,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:30" (2/3) ... [2025-03-17 03:08:31,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af8d0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:08:31, skipping insertion in model container [2025-03-17 03:08:31,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:31" (3/3) ... [2025-03-17 03:08:31,085 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i [2025-03-17 03:08:31,096 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:08:31,097 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-68.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:08:31,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:08:31,156 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;@c4fd8bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:08:31,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:08:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 116 states have internal predecessors, (169), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:08:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:08:31,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:31,174 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:31,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1975441966, now seen corresponding path program 1 times [2025-03-17 03:08:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296598057] [2025-03-17 03:08:31,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:31,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:31,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:31,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 03:08:31,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296598057] [2025-03-17 03:08:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296598057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880177452] [2025-03-17 03:08:31,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:31,536 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 03:08:31,538 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 03:08:31,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:31,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:31,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:31,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:31,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:08:31,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 03:08:31,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:08:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880177452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:08:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:08:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837833203] [2025-03-17 03:08:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:31,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:08:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:31,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:08:31,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:08:31,813 INFO L87 Difference]: Start difference. First operand has 158 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 116 states have internal predecessors, (169), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:08:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:31,869 INFO L93 Difference]: Finished difference Result 315 states and 537 transitions. [2025-03-17 03:08:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:08:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 266 [2025-03-17 03:08:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:31,876 INFO L225 Difference]: With dead ends: 315 [2025-03-17 03:08:31,876 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 03:08:31,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 267 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 03:08:31,883 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:31,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:08:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 03:08:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-17 03:08:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:08:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 245 transitions. [2025-03-17 03:08:31,921 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 245 transitions. Word has length 266 [2025-03-17 03:08:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:31,921 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 245 transitions. [2025-03-17 03:08:31,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:08:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 245 transitions. [2025-03-17 03:08:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:08:31,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:31,926 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:31,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:08:32,126 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 03:08:32,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1942490572, now seen corresponding path program 1 times [2025-03-17 03:08:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157774136] [2025-03-17 03:08:32,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:32,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:32,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:32,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:32,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:32,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157774136] [2025-03-17 03:08:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157774136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:32,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:08:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348822404] [2025-03-17 03:08:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:32,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:08:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:32,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:08:32,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:08:32,500 INFO L87 Difference]: Start difference. First operand 156 states and 245 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:32,551 INFO L93 Difference]: Finished difference Result 311 states and 489 transitions. [2025-03-17 03:08:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:08:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 266 [2025-03-17 03:08:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:32,553 INFO L225 Difference]: With dead ends: 311 [2025-03-17 03:08:32,553 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 03:08:32,554 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 03:08:32,555 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 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 03:08:32,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:08:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 03:08:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-17 03:08:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 114 states have internal predecessors, (164), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:08:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2025-03-17 03:08:32,568 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 266 [2025-03-17 03:08:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:32,570 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2025-03-17 03:08:32,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2025-03-17 03:08:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:08:32,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:32,574 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:08:32,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash -402176469, now seen corresponding path program 1 times [2025-03-17 03:08:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104842402] [2025-03-17 03:08:32,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:32,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:32,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:32,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:32,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:32,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:32,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104842402] [2025-03-17 03:08:32,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104842402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:32,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:08:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086533269] [2025-03-17 03:08:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:32,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:08:32,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:32,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:08:32,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:08:32,879 INFO L87 Difference]: Start difference. First operand 156 states and 244 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:33,027 INFO L93 Difference]: Finished difference Result 466 states and 730 transitions. [2025-03-17 03:08:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:08:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 266 [2025-03-17 03:08:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:33,031 INFO L225 Difference]: With dead ends: 466 [2025-03-17 03:08:33,033 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 03:08:33,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:08:33,034 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 228 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:33,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 611 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:08:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 03:08:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 204. [2025-03-17 03:08:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.4814814814814814) internal successors, (240), 162 states have internal predecessors, (240), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:08:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 320 transitions. [2025-03-17 03:08:33,065 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 320 transitions. Word has length 266 [2025-03-17 03:08:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:33,067 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 320 transitions. [2025-03-17 03:08:33,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 320 transitions. [2025-03-17 03:08:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:08:33,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:33,070 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:33,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:08:33,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:33,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2034980468, now seen corresponding path program 1 times [2025-03-17 03:08:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825448360] [2025-03-17 03:08:33,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:33,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:33,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:33,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:33,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825448360] [2025-03-17 03:08:34,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825448360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:34,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:34,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:08:34,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348675236] [2025-03-17 03:08:34,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:34,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:08:34,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:34,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:08:34,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:08:34,584 INFO L87 Difference]: Start difference. First operand 204 states and 320 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:08:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:35,491 INFO L93 Difference]: Finished difference Result 644 states and 1003 transitions. [2025-03-17 03:08:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:08:35,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 266 [2025-03-17 03:08:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:35,494 INFO L225 Difference]: With dead ends: 644 [2025-03-17 03:08:35,494 INFO L226 Difference]: Without dead ends: 441 [2025-03-17 03:08:35,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:08:35,496 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 776 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:35,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 534 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:08:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-17 03:08:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 417. [2025-03-17 03:08:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.5121293800539084) internal successors, (561), 372 states have internal predecessors, (561), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:08:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 647 transitions. [2025-03-17 03:08:35,514 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 647 transitions. Word has length 266 [2025-03-17 03:08:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:35,515 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 647 transitions. [2025-03-17 03:08:35,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 03:08:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 647 transitions. [2025-03-17 03:08:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:08:35,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:35,518 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:35,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:08:35,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:35,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash -681670771, now seen corresponding path program 1 times [2025-03-17 03:08:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:35,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696705551] [2025-03-17 03:08:35,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:35,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:35,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:35,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:35,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696705551] [2025-03-17 03:08:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696705551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:08:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220182895] [2025-03-17 03:08:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:08:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:35,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:08:35,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:08:35,875 INFO L87 Difference]: Start difference. First operand 417 states and 647 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:36,059 INFO L93 Difference]: Finished difference Result 839 states and 1305 transitions. [2025-03-17 03:08:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:08:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 266 [2025-03-17 03:08:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:36,066 INFO L225 Difference]: With dead ends: 839 [2025-03-17 03:08:36,067 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 03:08:36,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:08:36,069 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 174 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:36,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 350 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 03:08:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-17 03:08:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 377 states have (on average 1.5039787798408488) internal successors, (567), 378 states have internal predecessors, (567), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:08:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 653 transitions. [2025-03-17 03:08:36,095 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 653 transitions. Word has length 266 [2025-03-17 03:08:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 653 transitions. [2025-03-17 03:08:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 653 transitions. [2025-03-17 03:08:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 03:08:36,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:36,102 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:08:36,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash -426934226, now seen corresponding path program 1 times [2025-03-17 03:08:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076887169] [2025-03-17 03:08:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:36,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:36,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:36,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:36,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:36,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076887169] [2025-03-17 03:08:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076887169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254243928] [2025-03-17 03:08:36,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:36,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:36,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:36,456 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 03:08:36,458 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 03:08:36,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 03:08:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 03:08:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:36,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:08:36,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-03-17 03:08:37,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-17 03:08:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254243928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:37,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-17 03:08:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156221423] [2025-03-17 03:08:37,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:08:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:37,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:08:37,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:08:37,680 INFO L87 Difference]: Start difference. First operand 423 states and 653 transitions. Second operand has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-17 03:08:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:38,213 INFO L93 Difference]: Finished difference Result 775 states and 1191 transitions. [2025-03-17 03:08:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:08:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) Word has length 266 [2025-03-17 03:08:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:38,216 INFO L225 Difference]: With dead ends: 775 [2025-03-17 03:08:38,216 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 03:08:38,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:08:38,217 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 523 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:38,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 449 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:08:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 03:08:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-17 03:08:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 302 states have (on average 1.3973509933774835) internal successors, (422), 303 states have internal predecessors, (422), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:08:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 508 transitions. [2025-03-17 03:08:38,235 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 508 transitions. Word has length 266 [2025-03-17 03:08:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:38,235 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 508 transitions. [2025-03-17 03:08:38,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-17 03:08:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 508 transitions. [2025-03-17 03:08:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:08:38,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:38,240 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:38,257 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 03:08:38,440 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,SelfDestructingSolverStorable5 [2025-03-17 03:08:38,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:38,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1722309890, now seen corresponding path program 1 times [2025-03-17 03:08:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:38,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822403777] [2025-03-17 03:08:38,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:38,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:38,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:08:38,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:08:38,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:38,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822403777] [2025-03-17 03:08:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822403777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:08:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169624452] [2025-03-17 03:08:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:38,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:08:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:38,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:08:38,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:08:38,876 INFO L87 Difference]: Start difference. First operand 351 states and 508 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:39,141 INFO L93 Difference]: Finished difference Result 1061 states and 1535 transitions. [2025-03-17 03:08:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:08:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-17 03:08:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:39,145 INFO L225 Difference]: With dead ends: 1061 [2025-03-17 03:08:39,145 INFO L226 Difference]: Without dead ends: 711 [2025-03-17 03:08:39,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:08:39,147 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 165 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:39,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 630 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-17 03:08:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 583. [2025-03-17 03:08:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 489 states have (on average 1.3905930470347647) internal successors, (680), 490 states have internal predecessors, (680), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:08:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 846 transitions. [2025-03-17 03:08:39,196 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 846 transitions. Word has length 268 [2025-03-17 03:08:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:39,196 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 846 transitions. [2025-03-17 03:08:39,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 846 transitions. [2025-03-17 03:08:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:08:39,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:39,198 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:39,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:08:39,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:39,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash -562553565, now seen corresponding path program 1 times [2025-03-17 03:08:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923019864] [2025-03-17 03:08:39,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:39,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:08:39,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:08:39,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:39,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923019864] [2025-03-17 03:08:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923019864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:08:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975586552] [2025-03-17 03:08:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:40,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:08:40,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:40,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:08:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:08:40,779 INFO L87 Difference]: Start difference. First operand 583 states and 846 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:41,919 INFO L93 Difference]: Finished difference Result 1438 states and 2052 transitions. [2025-03-17 03:08:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:08:41,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-17 03:08:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:41,924 INFO L225 Difference]: With dead ends: 1438 [2025-03-17 03:08:41,925 INFO L226 Difference]: Without dead ends: 1088 [2025-03-17 03:08:41,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:08:41,926 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 720 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:41,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 851 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:08:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-17 03:08:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 620. [2025-03-17 03:08:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 526 states have (on average 1.397338403041825) internal successors, (735), 527 states have internal predecessors, (735), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:08:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 901 transitions. [2025-03-17 03:08:41,970 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 901 transitions. Word has length 268 [2025-03-17 03:08:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:41,971 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 901 transitions. [2025-03-17 03:08:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 901 transitions. [2025-03-17 03:08:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:08:41,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:41,974 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:41,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:08:41,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:41,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash 944998244, now seen corresponding path program 1 times [2025-03-17 03:08:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:41,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313670739] [2025-03-17 03:08:41,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:41,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:08:42,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:08:42,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:42,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:08:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313670739] [2025-03-17 03:08:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313670739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:42,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:42,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:08:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363494348] [2025-03-17 03:08:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:08:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:42,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:08:42,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:08:42,779 INFO L87 Difference]: Start difference. First operand 620 states and 901 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:44,082 INFO L93 Difference]: Finished difference Result 1505 states and 2172 transitions. [2025-03-17 03:08:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:08:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 268 [2025-03-17 03:08:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:44,088 INFO L225 Difference]: With dead ends: 1505 [2025-03-17 03:08:44,089 INFO L226 Difference]: Without dead ends: 886 [2025-03-17 03:08:44,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:08:44,092 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 560 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:44,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 778 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:08:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-17 03:08:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 658. [2025-03-17 03:08:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 564 states have (on average 1.4060283687943262) internal successors, (793), 565 states have internal predecessors, (793), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:08:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 959 transitions. [2025-03-17 03:08:44,125 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 959 transitions. Word has length 268 [2025-03-17 03:08:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:44,125 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 959 transitions. [2025-03-17 03:08:44,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:08:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 959 transitions. [2025-03-17 03:08:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 03:08:44,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:44,127 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:44,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:08:44,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1996659355, now seen corresponding path program 1 times [2025-03-17 03:08:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153120605] [2025-03-17 03:08:44,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:44,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:08:44,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:08:44,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:44,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:44,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:44,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153120605] [2025-03-17 03:08:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153120605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:44,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194267281] [2025-03-17 03:08:44,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:44,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:44,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:44,462 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 03:08:44,464 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 03:08:44,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 03:08:44,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 03:08:44,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:44,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:44,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:08:44,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1190 proven. 48 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-03-17 03:08:44,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:45,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194267281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:45,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:45,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2025-03-17 03:08:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127393887] [2025-03-17 03:08:45,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:45,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:08:45,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:45,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:08:45,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:08:45,054 INFO L87 Difference]: Start difference. First operand 658 states and 959 transitions. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-03-17 03:08:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:46,052 INFO L93 Difference]: Finished difference Result 2656 states and 3840 transitions. [2025-03-17 03:08:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 03:08:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 268 [2025-03-17 03:08:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:46,064 INFO L225 Difference]: With dead ends: 2656 [2025-03-17 03:08:46,064 INFO L226 Difference]: Without dead ends: 1999 [2025-03-17 03:08:46,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 533 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 03:08:46,066 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 606 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:46,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1485 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:08:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-03-17 03:08:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 712. [2025-03-17 03:08:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 614 states have (on average 1.3990228013029316) internal successors, (859), 615 states have internal predecessors, (859), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:08:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1025 transitions. [2025-03-17 03:08:46,132 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1025 transitions. Word has length 268 [2025-03-17 03:08:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:46,133 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1025 transitions. [2025-03-17 03:08:46,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-03-17 03:08:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1025 transitions. [2025-03-17 03:08:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-17 03:08:46,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:46,136 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:46,143 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 03:08:46,336 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 03:08:46,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1086047786, now seen corresponding path program 1 times [2025-03-17 03:08:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946721905] [2025-03-17 03:08:46,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:46,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:08:46,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:08:46,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:46,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946721905] [2025-03-17 03:08:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946721905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185272251] [2025-03-17 03:08:46,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:46,668 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 03:08:46,669 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 03:08:46,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:08:46,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:08:46,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:46,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:46,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:08:46,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2021 proven. 126 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-17 03:08:47,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 207 proven. 135 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-17 03:08:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185272251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:47,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-17 03:08:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770069834] [2025-03-17 03:08:47,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:47,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 03:08:47,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:47,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 03:08:47,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:08:47,728 INFO L87 Difference]: Start difference. First operand 712 states and 1025 transitions. Second operand has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 22 states have internal predecessors, (157), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-03-17 03:08:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:48,932 INFO L93 Difference]: Finished difference Result 2474 states and 3550 transitions. [2025-03-17 03:08:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 03:08:48,932 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 22 states have internal predecessors, (157), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) Word has length 269 [2025-03-17 03:08:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:48,939 INFO L225 Difference]: With dead ends: 2474 [2025-03-17 03:08:48,940 INFO L226 Difference]: Without dead ends: 1763 [2025-03-17 03:08:48,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=1822, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 03:08:48,943 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1549 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:48,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 651 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:08:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-17 03:08:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1224. [2025-03-17 03:08:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1091 states have (on average 1.3913840513290558) internal successors, (1518), 1095 states have internal predecessors, (1518), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 03:08:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1734 transitions. [2025-03-17 03:08:49,019 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1734 transitions. Word has length 269 [2025-03-17 03:08:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:49,020 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1734 transitions. [2025-03-17 03:08:49,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.826086956521739) internal successors, (157), 22 states have internal predecessors, (157), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109) [2025-03-17 03:08:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1734 transitions. [2025-03-17 03:08:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-17 03:08:49,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:49,023 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:49,031 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 03:08:49,223 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 03:08:49,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2006645760, now seen corresponding path program 1 times [2025-03-17 03:08:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402329916] [2025-03-17 03:08:49,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:49,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:08:49,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:08:49,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:49,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:50,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402329916] [2025-03-17 03:08:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402329916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15165550] [2025-03-17 03:08:50,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:50,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:50,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:50,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:08:50,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 03:08:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 03:08:50,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 03:08:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:50,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 03:08:50,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1520 proven. 378 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2025-03-17 03:08:51,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 120 proven. 222 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-17 03:08:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15165550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:51,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:51,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 14] total 33 [2025-03-17 03:08:51,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834295220] [2025-03-17 03:08:51,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 03:08:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:51,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 03:08:51,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 03:08:51,783 INFO L87 Difference]: Start difference. First operand 1224 states and 1734 transitions. Second operand has 33 states, 32 states have (on average 5.9375) internal successors, (190), 30 states have internal predecessors, (190), 10 states have call successors, (108), 5 states have call predecessors, (108), 10 states have return successors, (110), 10 states have call predecessors, (110), 10 states have call successors, (110) [2025-03-17 03:08:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:57,481 INFO L93 Difference]: Finished difference Result 3484 states and 4894 transitions. [2025-03-17 03:08:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-17 03:08:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.9375) internal successors, (190), 30 states have internal predecessors, (190), 10 states have call successors, (108), 5 states have call predecessors, (108), 10 states have return successors, (110), 10 states have call predecessors, (110), 10 states have call successors, (110) Word has length 269 [2025-03-17 03:08:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:57,489 INFO L225 Difference]: With dead ends: 3484 [2025-03-17 03:08:57,489 INFO L226 Difference]: Without dead ends: 2253 [2025-03-17 03:08:57,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6065 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3635, Invalid=14997, Unknown=0, NotChecked=0, Total=18632 [2025-03-17 03:08:57,496 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2637 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 4918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 4076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:57,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2637 Valid, 2309 Invalid, 4918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 03:08:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2025-03-17 03:08:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2096. [2025-03-17 03:08:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1829 states have (on average 1.3646801530891197) internal successors, (2496), 1835 states have internal predecessors, (2496), 210 states have call successors, (210), 56 states have call predecessors, (210), 56 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:08:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2916 transitions. [2025-03-17 03:08:57,617 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2916 transitions. Word has length 269 [2025-03-17 03:08:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:57,618 INFO L471 AbstractCegarLoop]: Abstraction has 2096 states and 2916 transitions. [2025-03-17 03:08:57,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.9375) internal successors, (190), 30 states have internal predecessors, (190), 10 states have call successors, (108), 5 states have call predecessors, (108), 10 states have return successors, (110), 10 states have call predecessors, (110), 10 states have call successors, (110) [2025-03-17 03:08:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2916 transitions. [2025-03-17 03:08:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-17 03:08:57,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:57,621 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:57,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 03:08:57,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 03:08:57,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:57,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1758872758, now seen corresponding path program 1 times [2025-03-17 03:08:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776779191] [2025-03-17 03:08:57,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:57,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-17 03:08:57,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-17 03:08:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:58,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776779191] [2025-03-17 03:08:58,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776779191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186500284] [2025-03-17 03:08:58,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:58,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:08:58,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 03:08:58,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-17 03:08:58,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-17 03:08:58,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:58,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:58,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:08:58,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-03-17 03:08:58,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:08:58,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186500284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:58,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:58,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-17 03:08:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128215719] [2025-03-17 03:08:58,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:08:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:58,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:08:58,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:08:58,942 INFO L87 Difference]: Start difference. First operand 2096 states and 2916 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (114), 4 states have call predecessors, (114), 4 states have call successors, (114) [2025-03-17 03:08:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:59,488 INFO L93 Difference]: Finished difference Result 4311 states and 5991 transitions. [2025-03-17 03:08:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:08:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (114), 4 states have call predecessors, (114), 4 states have call successors, (114) Word has length 270 [2025-03-17 03:08:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:59,496 INFO L225 Difference]: With dead ends: 4311 [2025-03-17 03:08:59,497 INFO L226 Difference]: Without dead ends: 2216 [2025-03-17 03:08:59,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:08:59,501 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 412 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:59,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 700 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:08:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-03-17 03:08:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2164. [2025-03-17 03:08:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1893 states have (on average 1.3481246698362388) internal successors, (2552), 1899 states have internal predecessors, (2552), 210 states have call successors, (210), 60 states have call predecessors, (210), 60 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:08:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 2972 transitions. [2025-03-17 03:08:59,649 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 2972 transitions. Word has length 270 [2025-03-17 03:08:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:59,649 INFO L471 AbstractCegarLoop]: Abstraction has 2164 states and 2972 transitions. [2025-03-17 03:08:59,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 4 states have call successors, (112), 2 states have call predecessors, (112), 4 states have return successors, (114), 4 states have call predecessors, (114), 4 states have call successors, (114) [2025-03-17 03:08:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2972 transitions. [2025-03-17 03:08:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:08:59,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:59,654 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:59,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 03:08:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:59,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash -294100464, now seen corresponding path program 1 times [2025-03-17 03:08:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805729498] [2025-03-17 03:08:59,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:59,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:08:59,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:08:59,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:09:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805729498] [2025-03-17 03:09:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805729498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:09:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:09:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:09:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916268003] [2025-03-17 03:09:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:09:01,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:09:01,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:01,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:09:01,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:09:01,867 INFO L87 Difference]: Start difference. First operand 2164 states and 2972 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:04,011 INFO L93 Difference]: Finished difference Result 4705 states and 6428 transitions. [2025-03-17 03:09:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:09:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 272 [2025-03-17 03:09:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:04,020 INFO L225 Difference]: With dead ends: 4705 [2025-03-17 03:09:04,021 INFO L226 Difference]: Without dead ends: 2535 [2025-03-17 03:09:04,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-03-17 03:09:04,024 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 742 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:04,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1736 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 03:09:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2025-03-17 03:09:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2168. [2025-03-17 03:09:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1897 states have (on average 1.3479177648919347) internal successors, (2557), 1903 states have internal predecessors, (2557), 210 states have call successors, (210), 60 states have call predecessors, (210), 60 states have return successors, (210), 204 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-17 03:09:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2977 transitions. [2025-03-17 03:09:04,171 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2977 transitions. Word has length 272 [2025-03-17 03:09:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2977 transitions. [2025-03-17 03:09:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2977 transitions. [2025-03-17 03:09:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:09:04,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:04,176 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:04,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:09:04,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:04,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2019581361, now seen corresponding path program 1 times [2025-03-17 03:09:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345987481] [2025-03-17 03:09:04,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:09:04,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:09:04,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:04,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 99 proven. 129 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-03-17 03:09:09,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345987481] [2025-03-17 03:09:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345987481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:09:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078800806] [2025-03-17 03:09:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:09:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:09:09,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:09:09,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 03:09:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:09:09,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:09:09,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:09,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:09,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 03:09:09,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1613 proven. 237 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2025-03-17 03:09:10,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:09:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:09:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078800806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:09:11,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:09:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 10] total 35 [2025-03-17 03:09:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122534481] [2025-03-17 03:09:11,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:09:11,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 03:09:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:11,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 03:09:11,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 03:09:11,661 INFO L87 Difference]: Start difference. First operand 2168 states and 2977 transitions. Second operand has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 35 states have internal predecessors, (207), 7 states have call successors, (120), 5 states have call predecessors, (120), 9 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) [2025-03-17 03:09:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:22,549 INFO L93 Difference]: Finished difference Result 7894 states and 10900 transitions. [2025-03-17 03:09:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-17 03:09:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 35 states have internal predecessors, (207), 7 states have call successors, (120), 5 states have call predecessors, (120), 9 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) Word has length 272 [2025-03-17 03:09:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:22,568 INFO L225 Difference]: With dead ends: 7894 [2025-03-17 03:09:22,568 INFO L226 Difference]: Without dead ends: 5727 [2025-03-17 03:09:22,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2032, Invalid=7670, Unknown=0, NotChecked=0, Total=9702 [2025-03-17 03:09:22,572 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2785 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 5977 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2785 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 6269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 5977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:22,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2785 Valid, 3238 Invalid, 6269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 5977 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-17 03:09:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2025-03-17 03:09:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 1628. [2025-03-17 03:09:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1514 states have (on average 1.3764861294583883) internal successors, (2084), 1515 states have internal predecessors, (2084), 83 states have call successors, (83), 30 states have call predecessors, (83), 30 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-17 03:09:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2250 transitions. [2025-03-17 03:09:22,709 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2250 transitions. Word has length 272 [2025-03-17 03:09:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:22,709 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2250 transitions. [2025-03-17 03:09:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 35 states have internal predecessors, (207), 7 states have call successors, (120), 5 states have call predecessors, (120), 9 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) [2025-03-17 03:09:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2250 transitions. [2025-03-17 03:09:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:09:22,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:22,712 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:22,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 03:09:22,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:09:22,913 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash -185830162, now seen corresponding path program 1 times [2025-03-17 03:09:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999870895] [2025-03-17 03:09:22,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:22,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:09:22,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:09:22,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:22,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:09:23,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:23,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999870895] [2025-03-17 03:09:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999870895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:09:23,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697463372] [2025-03-17 03:09:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:23,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:09:23,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:09:23,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:09:23,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 03:09:23,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:09:23,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:09:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:23,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:09:23,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1219 proven. 87 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2025-03-17 03:09:23,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:09:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:09:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697463372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:09:23,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:09:23,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 03:09:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178031353] [2025-03-17 03:09:23,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:09:23,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:09:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:23,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:09:23,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:09:23,723 INFO L87 Difference]: Start difference. First operand 1628 states and 2250 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-17 03:09:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:24,272 INFO L93 Difference]: Finished difference Result 4922 states and 6784 transitions. [2025-03-17 03:09:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:09:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 272 [2025-03-17 03:09:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:24,284 INFO L225 Difference]: With dead ends: 4922 [2025-03-17 03:09:24,284 INFO L226 Difference]: Without dead ends: 3295 [2025-03-17 03:09:24,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 541 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:09:24,288 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 580 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:24,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 610 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:09:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2025-03-17 03:09:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3269. [2025-03-17 03:09:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3038 states have (on average 1.3670177748518761) internal successors, (4153), 3040 states have internal predecessors, (4153), 166 states have call successors, (166), 64 states have call predecessors, (166), 64 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-17 03:09:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4485 transitions. [2025-03-17 03:09:24,543 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4485 transitions. Word has length 272 [2025-03-17 03:09:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:24,543 INFO L471 AbstractCegarLoop]: Abstraction has 3269 states and 4485 transitions. [2025-03-17 03:09:24,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-17 03:09:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4485 transitions. [2025-03-17 03:09:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 03:09:24,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:24,548 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:24,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 03:09:24,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 03:09:24,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:24,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1167479535, now seen corresponding path program 1 times [2025-03-17 03:09:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17515764] [2025-03-17 03:09:24,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:24,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:09:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:09:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 150 proven. 78 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2025-03-17 03:09:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17515764] [2025-03-17 03:09:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17515764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:09:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871004540] [2025-03-17 03:09:25,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:25,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:09:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:09:25,115 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:09:25,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 03:09:25,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-17 03:09:25,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 03:09:25,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:25,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:25,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:09:25,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-17 03:09:25,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:09:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-17 03:09:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871004540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:09:25,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:09:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 24 [2025-03-17 03:09:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364716846] [2025-03-17 03:09:25,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:09:25,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 03:09:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:25,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 03:09:25,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:09:25,966 INFO L87 Difference]: Start difference. First operand 3269 states and 4485 transitions. Second operand has 24 states, 23 states have (on average 6.869565217391305) internal successors, (158), 22 states have internal predecessors, (158), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) [2025-03-17 03:09:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:27,383 INFO L93 Difference]: Finished difference Result 7393 states and 9969 transitions. [2025-03-17 03:09:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 03:09:27,384 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.869565217391305) internal successors, (158), 22 states have internal predecessors, (158), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) Word has length 272 [2025-03-17 03:09:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:27,395 INFO L225 Difference]: With dead ends: 7393 [2025-03-17 03:09:27,395 INFO L226 Difference]: Without dead ends: 4125 [2025-03-17 03:09:27,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=856, Invalid=2224, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 03:09:27,400 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 816 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:27,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1416 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:09:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2025-03-17 03:09:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 1003. [2025-03-17 03:09:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 884 states have (on average 1.3144796380090498) internal successors, (1162), 884 states have internal predecessors, (1162), 80 states have call successors, (80), 38 states have call predecessors, (80), 38 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 03:09:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1322 transitions. [2025-03-17 03:09:27,615 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1322 transitions. Word has length 272 [2025-03-17 03:09:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:27,615 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1322 transitions. [2025-03-17 03:09:27,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.869565217391305) internal successors, (158), 22 states have internal predecessors, (158), 8 states have call successors, (82), 4 states have call predecessors, (82), 9 states have return successors, (83), 8 states have call predecessors, (83), 8 states have call successors, (83) [2025-03-17 03:09:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1322 transitions. [2025-03-17 03:09:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 03:09:27,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:27,618 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:27,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 03:09:27,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 03:09:27,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:27,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 889040334, now seen corresponding path program 1 times [2025-03-17 03:09:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:27,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410063241] [2025-03-17 03:09:27,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:27,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 03:09:27,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 03:09:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:09:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:27,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410063241] [2025-03-17 03:09:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410063241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:09:27,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:09:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:09:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792359133] [2025-03-17 03:09:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:09:27,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:09:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:27,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:09:27,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:09:27,986 INFO L87 Difference]: Start difference. First operand 1003 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:28,308 INFO L93 Difference]: Finished difference Result 2255 states and 2991 transitions. [2025-03-17 03:09:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:09:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 273 [2025-03-17 03:09:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:28,313 INFO L225 Difference]: With dead ends: 2255 [2025-03-17 03:09:28,313 INFO L226 Difference]: Without dead ends: 1253 [2025-03-17 03:09:28,315 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 03:09:28,315 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 224 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:28,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 451 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:09:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-17 03:09:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1027. [2025-03-17 03:09:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 908 states have (on average 1.3061674008810573) internal successors, (1186), 908 states have internal predecessors, (1186), 80 states have call successors, (80), 38 states have call predecessors, (80), 38 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 03:09:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1346 transitions. [2025-03-17 03:09:28,438 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1346 transitions. Word has length 273 [2025-03-17 03:09:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:28,439 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1346 transitions. [2025-03-17 03:09:28,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1346 transitions. [2025-03-17 03:09:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 03:09:28,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:28,440 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:28,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 03:09:28,440 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:28,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2133804815, now seen corresponding path program 1 times [2025-03-17 03:09:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103880624] [2025-03-17 03:09:28,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:28,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 03:09:28,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 03:09:28,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:28,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:09:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103880624] [2025-03-17 03:09:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103880624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:09:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:09:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:09:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530625598] [2025-03-17 03:09:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:09:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:09:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:31,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:09:31,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:09:31,300 INFO L87 Difference]: Start difference. First operand 1027 states and 1346 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:33,276 INFO L93 Difference]: Finished difference Result 3861 states and 5066 transitions. [2025-03-17 03:09:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:09:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 273 [2025-03-17 03:09:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:33,282 INFO L225 Difference]: With dead ends: 3861 [2025-03-17 03:09:33,282 INFO L226 Difference]: Without dead ends: 2835 [2025-03-17 03:09:33,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:09:33,284 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 745 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:33,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 968 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:09:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-03-17 03:09:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1073. [2025-03-17 03:09:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 954 states have (on average 1.3144654088050314) internal successors, (1254), 954 states have internal predecessors, (1254), 80 states have call successors, (80), 38 states have call predecessors, (80), 38 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 03:09:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1414 transitions. [2025-03-17 03:09:33,423 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1414 transitions. Word has length 273 [2025-03-17 03:09:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:33,424 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1414 transitions. [2025-03-17 03:09:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1414 transitions. [2025-03-17 03:09:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 03:09:33,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:33,425 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:33,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 03:09:33,426 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:33,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1136468560, now seen corresponding path program 1 times [2025-03-17 03:09:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:33,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526798270] [2025-03-17 03:09:33,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:33,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 03:09:33,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 03:09:33,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:33,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 03:09:33,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:33,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526798270] [2025-03-17 03:09:33,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526798270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:09:33,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:09:33,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:09:33,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661858256] [2025-03-17 03:09:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:09:33,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:09:33,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:33,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:09:33,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:09:33,737 INFO L87 Difference]: Start difference. First operand 1073 states and 1414 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:34,024 INFO L93 Difference]: Finished difference Result 2379 states and 3132 transitions. [2025-03-17 03:09:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:09:34,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 273 [2025-03-17 03:09:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:34,028 INFO L225 Difference]: With dead ends: 2379 [2025-03-17 03:09:34,028 INFO L226 Difference]: Without dead ends: 1307 [2025-03-17 03:09:34,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:09:34,029 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 176 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:34,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 493 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:09:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-17 03:09:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 895. [2025-03-17 03:09:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 776 states have (on average 1.2835051546391754) internal successors, (996), 776 states have internal predecessors, (996), 80 states have call successors, (80), 38 states have call predecessors, (80), 38 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 03:09:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1156 transitions. [2025-03-17 03:09:34,155 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1156 transitions. Word has length 273 [2025-03-17 03:09:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:34,156 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1156 transitions. [2025-03-17 03:09:34,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 03:09:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1156 transitions. [2025-03-17 03:09:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-17 03:09:34,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:34,157 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:09:34,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 03:09:34,157 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:34,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1785021632, now seen corresponding path program 1 times [2025-03-17 03:09:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:09:34,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189600071] [2025-03-17 03:09:34,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:09:34,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 03:09:34,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 03:09:34,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:34,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-17 03:09:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:09:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189600071] [2025-03-17 03:09:38,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189600071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:09:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958063969] [2025-03-17 03:09:38,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:38,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:09:38,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:09:38,688 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:09:38,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 03:09:38,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-17 03:09:38,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-17 03:09:38,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:38,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:38,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 03:09:38,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2111 proven. 282 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-17 03:09:42,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:09:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 69 proven. 273 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-17 03:09:47,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958063969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:09:47,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:09:47,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24, 23] total 57 [2025-03-17 03:09:47,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305457746] [2025-03-17 03:09:47,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:09:47,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 03:09:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:09:47,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 03:09:47,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2645, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 03:09:47,350 INFO L87 Difference]: Start difference. First operand 895 states and 1156 transitions. Second operand has 57 states, 56 states have (on average 4.214285714285714) internal successors, (236), 55 states have internal predecessors, (236), 11 states have call successors, (120), 6 states have call predecessors, (120), 13 states have return successors, (120), 11 states have call predecessors, (120), 11 states have call successors, (120)