./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef425419d893cdf8f2db575b031c5b203ea887f7ed28e92ca0beafffac1fc1ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:00:33,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:00:33,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:00:33,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:00:33,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:00:33,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:00:33,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:00:33,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:00:33,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:00:33,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:00:33,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:00:33,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:00:33,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:00:33,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:00:33,363 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:00:33,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:00:33,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:00:33,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:00:33,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:00:33,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:00:33,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:00:33,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:00:33,367 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef425419d893cdf8f2db575b031c5b203ea887f7ed28e92ca0beafffac1fc1ee [2025-02-05 22:00:33,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:00:33,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:00:33,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:00:33,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:00:33,676 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:00:33,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i [2025-02-05 22:00:35,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbd3d5881/0de1d22bc15e4789bb98b0e5abf36cc1/FLAGea4263ed5 [2025-02-05 22:00:35,403 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:00:35,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i [2025-02-05 22:00:35,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbd3d5881/0de1d22bc15e4789bb98b0e5abf36cc1/FLAGea4263ed5 [2025-02-05 22:00:35,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbd3d5881/0de1d22bc15e4789bb98b0e5abf36cc1 [2025-02-05 22:00:35,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:00:35,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:00:35,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:00:35,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:00:35,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:00:35,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:35,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13491ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35, skipping insertion in model container [2025-02-05 22:00:35,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:35,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:00:35,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i[916,929] [2025-02-05 22:00:35,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:00:35,787 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:00:35,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i[916,929] [2025-02-05 22:00:35,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:00:35,911 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:00:35,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35 WrapperNode [2025-02-05 22:00:35,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:00:35,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:00:35,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:00:35,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:00:35,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:35,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,012 INFO L138 Inliner]: procedures = 26, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 755 [2025-02-05 22:00:36,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:00:36,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:00:36,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:00:36,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:00:36,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,087 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:00:36,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:00:36,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:00:36,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:00:36,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:00:36,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (1/1) ... [2025-02-05 22:00:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:00:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:00:36,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:00:36,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:00:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:00:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:00:36,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:00:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:00:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:00:36,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:00:36,390 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:00:36,392 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:00:37,835 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 22:00:37,835 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:00:37,880 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:00:37,880 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:00:37,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:00:37 BoogieIcfgContainer [2025-02-05 22:00:37,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:00:37,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:00:37,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:00:37,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:00:37,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:00:35" (1/3) ... [2025-02-05 22:00:37,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38db1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:00:37, skipping insertion in model container [2025-02-05 22:00:37,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:00:35" (2/3) ... [2025-02-05 22:00:37,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38db1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:00:37, skipping insertion in model container [2025-02-05 22:00:37,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:00:37" (3/3) ... [2025-02-05 22:00:37,895 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-71.i [2025-02-05 22:00:37,907 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:00:37,911 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-71.i that has 2 procedures, 318 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:00:37,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:00:37,994 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;@38359d48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:00:37,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:00:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 218 states have (on average 1.6009174311926606) internal successors, (349), 219 states have internal predecessors, (349), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 22:00:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:38,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:38,028 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:38,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:38,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1772533918, now seen corresponding path program 1 times [2025-02-05 22:00:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304596595] [2025-02-05 22:00:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:38,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:38,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:38,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:38,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:38,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2025-02-05 22:00:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304596595] [2025-02-05 22:00:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304596595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:00:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212132271] [2025-02-05 22:00:38,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:38,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:00:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:00:38,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:00:38,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:00:39,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:39,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:39,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:39,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:00:39,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:00:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2025-02-05 22:00:39,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:00:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212132271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:39,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:00:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:00:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446789778] [2025-02-05 22:00:39,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:39,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:00:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:39,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:00:39,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:00:39,401 INFO L87 Difference]: Start difference. First operand has 318 states, 218 states have (on average 1.6009174311926606) internal successors, (349), 219 states have internal predecessors, (349), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) [2025-02-05 22:00:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:39,495 INFO L93 Difference]: Finished difference Result 630 states and 1178 transitions. [2025-02-05 22:00:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:00:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) Word has length 616 [2025-02-05 22:00:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:39,510 INFO L225 Difference]: With dead ends: 630 [2025-02-05 22:00:39,510 INFO L226 Difference]: Without dead ends: 315 [2025-02-05 22:00:39,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:00:39,523 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:39,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:00:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-05 22:00:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-02-05 22:00:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 216 states have (on average 1.5833333333333333) internal successors, (342), 216 states have internal predecessors, (342), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 22:00:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 536 transitions. [2025-02-05 22:00:39,629 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 536 transitions. Word has length 616 [2025-02-05 22:00:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:39,632 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 536 transitions. [2025-02-05 22:00:39,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) [2025-02-05 22:00:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 536 transitions. [2025-02-05 22:00:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:39,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:39,652 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:39,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:00:39,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:00:39,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1932384521, now seen corresponding path program 1 times [2025-02-05 22:00:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:39,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081743758] [2025-02-05 22:00:39,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:39,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:40,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:40,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:40,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081743758] [2025-02-05 22:00:40,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081743758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:40,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771465178] [2025-02-05 22:00:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:40,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:40,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:40,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:40,721 INFO L87 Difference]: Start difference. First operand 315 states and 536 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:40,861 INFO L93 Difference]: Finished difference Result 851 states and 1455 transitions. [2025-02-05 22:00:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-02-05 22:00:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:40,873 INFO L225 Difference]: With dead ends: 851 [2025-02-05 22:00:40,874 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 22:00:40,876 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-02-05 22:00:40,877 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 375 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:40,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1251 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 22:00:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2025-02-05 22:00:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 390 states have (on average 1.623076923076923) internal successors, (633), 391 states have internal predecessors, (633), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-05 22:00:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 919 transitions. [2025-02-05 22:00:40,999 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 919 transitions. Word has length 616 [2025-02-05 22:00:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:41,001 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 919 transitions. [2025-02-05 22:00:41,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 919 transitions. [2025-02-05 22:00:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:41,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:41,019 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:00:41,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1009700938, now seen corresponding path program 1 times [2025-02-05 22:00:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:41,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858722956] [2025-02-05 22:00:41,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:41,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:41,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:41,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:41,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:41,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858722956] [2025-02-05 22:00:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858722956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669984033] [2025-02-05 22:00:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:41,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:41,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:41,494 INFO L87 Difference]: Start difference. First operand 536 states and 919 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:41,681 INFO L93 Difference]: Finished difference Result 1488 states and 2556 transitions. [2025-02-05 22:00:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:41,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-02-05 22:00:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:41,698 INFO L225 Difference]: With dead ends: 1488 [2025-02-05 22:00:41,701 INFO L226 Difference]: Without dead ends: 955 [2025-02-05 22:00:41,704 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-02-05 22:00:41,707 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 336 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:41,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1151 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-02-05 22:00:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 952. [2025-02-05 22:00:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 708 states have (on average 1.6299435028248588) internal successors, (1154), 711 states have internal predecessors, (1154), 239 states have call successors, (239), 4 states have call predecessors, (239), 4 states have return successors, (239), 236 states have call predecessors, (239), 239 states have call successors, (239) [2025-02-05 22:00:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1632 transitions. [2025-02-05 22:00:41,836 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1632 transitions. Word has length 616 [2025-02-05 22:00:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:41,839 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1632 transitions. [2025-02-05 22:00:41,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1632 transitions. [2025-02-05 22:00:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:41,855 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:00:41,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash -940599317, now seen corresponding path program 1 times [2025-02-05 22:00:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41822072] [2025-02-05 22:00:41,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:41,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:41,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:41,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:41,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41822072] [2025-02-05 22:00:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41822072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015723884] [2025-02-05 22:00:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:42,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:42,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:42,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:42,209 INFO L87 Difference]: Start difference. First operand 952 states and 1632 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:42,377 INFO L93 Difference]: Finished difference Result 2850 states and 4890 transitions. [2025-02-05 22:00:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-02-05 22:00:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:42,395 INFO L225 Difference]: With dead ends: 2850 [2025-02-05 22:00:42,395 INFO L226 Difference]: Without dead ends: 1901 [2025-02-05 22:00:42,401 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-02-05 22:00:42,403 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 508 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:42,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1470 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-02-05 22:00:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1899. [2025-02-05 22:00:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1412 states have (on average 1.6246458923512748) internal successors, (2294), 1418 states have internal predecessors, (2294), 478 states have call successors, (478), 8 states have call predecessors, (478), 8 states have return successors, (478), 472 states have call predecessors, (478), 478 states have call successors, (478) [2025-02-05 22:00:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 3250 transitions. [2025-02-05 22:00:42,683 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 3250 transitions. Word has length 616 [2025-02-05 22:00:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:42,684 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 3250 transitions. [2025-02-05 22:00:42,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3250 transitions. [2025-02-05 22:00:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:42,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:42,697 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:42,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:00:42,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:42,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -948358676, now seen corresponding path program 1 times [2025-02-05 22:00:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:42,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9210643] [2025-02-05 22:00:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:42,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:42,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:42,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:42,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:43,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9210643] [2025-02-05 22:00:43,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9210643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037282106] [2025-02-05 22:00:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:43,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:43,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:43,008 INFO L87 Difference]: Start difference. First operand 1899 states and 3250 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:43,292 INFO L93 Difference]: Finished difference Result 5385 states and 9204 transitions. [2025-02-05 22:00:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-02-05 22:00:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:43,320 INFO L225 Difference]: With dead ends: 5385 [2025-02-05 22:00:43,320 INFO L226 Difference]: Without dead ends: 3489 [2025-02-05 22:00:43,327 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-02-05 22:00:43,329 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 332 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:43,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1109 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2025-02-05 22:00:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3485. [2025-02-05 22:00:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2602 states have (on average 1.6133743274404304) internal successors, (4198), 2616 states have internal predecessors, (4198), 866 states have call successors, (866), 16 states have call predecessors, (866), 16 states have return successors, (866), 852 states have call predecessors, (866), 866 states have call successors, (866) [2025-02-05 22:00:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 5930 transitions. [2025-02-05 22:00:43,607 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 5930 transitions. Word has length 616 [2025-02-05 22:00:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:43,608 INFO L471 AbstractCegarLoop]: Abstraction has 3485 states and 5930 transitions. [2025-02-05 22:00:43,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 5930 transitions. [2025-02-05 22:00:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:43,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:43,617 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:43,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:00:43,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -794845108, now seen corresponding path program 1 times [2025-02-05 22:00:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090836468] [2025-02-05 22:00:43,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:43,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:43,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:43,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:43,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:43,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090836468] [2025-02-05 22:00:43,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090836468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:43,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:43,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:43,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267567163] [2025-02-05 22:00:43,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:43,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:43,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:43,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:43,959 INFO L87 Difference]: Start difference. First operand 3485 states and 5930 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:44,356 INFO L93 Difference]: Finished difference Result 10449 states and 17784 transitions. [2025-02-05 22:00:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-02-05 22:00:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:44,439 INFO L225 Difference]: With dead ends: 10449 [2025-02-05 22:00:44,439 INFO L226 Difference]: Without dead ends: 6967 [2025-02-05 22:00:44,450 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-02-05 22:00:44,451 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 522 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:44,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1522 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6967 states. [2025-02-05 22:00:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6967 to 6965. [2025-02-05 22:00:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 5200 states have (on average 1.6076923076923078) internal successors, (8360), 5228 states have internal predecessors, (8360), 1732 states have call successors, (1732), 32 states have call predecessors, (1732), 32 states have return successors, (1732), 1704 states have call predecessors, (1732), 1732 states have call successors, (1732) [2025-02-05 22:00:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 11824 transitions. [2025-02-05 22:00:45,028 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 11824 transitions. Word has length 616 [2025-02-05 22:00:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:45,030 INFO L471 AbstractCegarLoop]: Abstraction has 6965 states and 11824 transitions. [2025-02-05 22:00:45,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 11824 transitions. [2025-02-05 22:00:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-02-05 22:00:45,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:45,041 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:45,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:00:45,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 712706701, now seen corresponding path program 1 times [2025-02-05 22:00:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841881469] [2025-02-05 22:00:45,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:45,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-02-05 22:00:45,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-02-05 22:00:45,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:45,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841881469] [2025-02-05 22:00:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841881469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:00:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690006676] [2025-02-05 22:00:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:00:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:45,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:00:45,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:00:45,659 INFO L87 Difference]: Start difference. First operand 6965 states and 11824 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:49,140 INFO L93 Difference]: Finished difference Result 53829 states and 90520 transitions. [2025-02-05 22:00:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:00:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-02-05 22:00:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:49,425 INFO L225 Difference]: With dead ends: 53829 [2025-02-05 22:00:49,425 INFO L226 Difference]: Without dead ends: 46867 [2025-02-05 22:00:49,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:00:49,472 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 1766 mSDsluCounter, 3767 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 5051 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:49,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 5051 Invalid, 720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [374 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:00:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46867 states. [2025-02-05 22:00:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46867 to 46837. [2025-02-05 22:00:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46837 states, 33412 states have (on average 1.5617143541242666) internal successors, (52180), 33652 states have internal predecessors, (52180), 13168 states have call successors, (13168), 256 states have call predecessors, (13168), 256 states have return successors, (13168), 12928 states have call predecessors, (13168), 13168 states have call successors, (13168) [2025-02-05 22:00:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46837 states to 46837 states and 78516 transitions. [2025-02-05 22:00:53,413 INFO L78 Accepts]: Start accepts. Automaton has 46837 states and 78516 transitions. Word has length 616 [2025-02-05 22:00:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:53,416 INFO L471 AbstractCegarLoop]: Abstraction has 46837 states and 78516 transitions. [2025-02-05 22:00:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:00:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 46837 states and 78516 transitions. [2025-02-05 22:00:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-02-05 22:00:53,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:53,439 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:00:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:00:53,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 572180515, now seen corresponding path program 1 times [2025-02-05 22:00:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652491577] [2025-02-05 22:00:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:53,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-02-05 22:00:53,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-02-05 22:00:53,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:53,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:00:57,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652491577] [2025-02-05 22:00:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652491577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:00:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081359856] [2025-02-05 22:00:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:57,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:00:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:57,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:00:57,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:00:57,769 INFO L87 Difference]: Start difference. First operand 46837 states and 78516 transitions. Second operand has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:01:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:19,485 INFO L93 Difference]: Finished difference Result 265155 states and 438979 transitions. [2025-02-05 22:01:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-02-05 22:01:19,486 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 617 [2025-02-05 22:01:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:21,083 INFO L225 Difference]: With dead ends: 265155 [2025-02-05 22:01:21,085 INFO L226 Difference]: Without dead ends: 218321 [2025-02-05 22:01:21,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=942, Invalid=3218, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 22:01:21,355 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 10737 mSDsluCounter, 7400 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 2191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10737 SdHoareTripleChecker+Valid, 7971 SdHoareTripleChecker+Invalid, 6772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2191 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:21,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10737 Valid, 7971 Invalid, 6772 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2191 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-02-05 22:01:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218321 states. [2025-02-05 22:01:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218321 to 138437. [2025-02-05 22:01:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138437 states, 103420 states have (on average 1.5709920711661187) internal successors, (162472), 104260 states have internal predecessors, (162472), 33960 states have call successors, (33960), 1056 states have call predecessors, (33960), 1056 states have return successors, (33960), 33120 states have call predecessors, (33960), 33960 states have call successors, (33960) [2025-02-05 22:01:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138437 states to 138437 states and 230392 transitions. [2025-02-05 22:01:32,965 INFO L78 Accepts]: Start accepts. Automaton has 138437 states and 230392 transitions. Word has length 617 [2025-02-05 22:01:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 138437 states and 230392 transitions. [2025-02-05 22:01:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:01:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 138437 states and 230392 transitions. [2025-02-05 22:01:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-02-05 22:01:33,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:33,022 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:01:33,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:01:33,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:33,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2114831521, now seen corresponding path program 1 times [2025-02-05 22:01:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616628172] [2025-02-05 22:01:33,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:33,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:33,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-02-05 22:01:33,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-02-05 22:01:33,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:33,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 153 proven. 135 refuted. 0 times theorem prover too weak. 18336 trivial. 0 not checked. [2025-02-05 22:01:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:34,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616628172] [2025-02-05 22:01:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616628172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:01:34,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277102093] [2025-02-05 22:01:34,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:34,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:01:34,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:34,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:01:34,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:01:34,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-02-05 22:01:34,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-02-05 22:01:34,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:34,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:34,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 22:01:34,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:01:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 9298 proven. 159 refuted. 0 times theorem prover too weak. 9167 trivial. 0 not checked. [2025-02-05 22:01:36,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:01:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 129 proven. 159 refuted. 0 times theorem prover too weak. 18336 trivial. 0 not checked. [2025-02-05 22:01:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277102093] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:01:38,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:01:38,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 13] total 23 [2025-02-05 22:01:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659228777] [2025-02-05 22:01:38,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:01:38,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 22:01:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:38,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 22:01:38,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:01:38,148 INFO L87 Difference]: Start difference. First operand 138437 states and 230392 transitions. Second operand has 23 states, 23 states have (on average 10.869565217391305) internal successors, (250), 23 states have internal predecessors, (250), 3 states have call successors, (203), 2 states have call predecessors, (203), 4 states have return successors, (205), 3 states have call predecessors, (205), 3 states have call successors, (205)