./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_operatoramount_amount500_file-48.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 5054d685be7479f98d5d246ff0f244e50fabd251a7020bbdbd6362d047caf08a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:21,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:21,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:47:21,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:21,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:21,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:21,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:21,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:21,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:21,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:21,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:21,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:21,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:21,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:21,436 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:21,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:21,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:21,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:21,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:21,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:21,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:21,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:21,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:21,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:21,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:21,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:21,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:21,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:21,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:21,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:21,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:21,442 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 -> 5054d685be7479f98d5d246ff0f244e50fabd251a7020bbdbd6362d047caf08a [2025-01-09 14:47:21,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:21,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:21,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:21,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:21,687 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:21,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i [2025-01-09 14:47:22,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aa02970a/d46a415255534540b7bb6b273e9f394d/FLAG8247fe0d4 [2025-01-09 14:47:23,200 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:23,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-48.i [2025-01-09 14:47:23,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aa02970a/d46a415255534540b7bb6b273e9f394d/FLAG8247fe0d4 [2025-01-09 14:47:23,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aa02970a/d46a415255534540b7bb6b273e9f394d [2025-01-09 14:47:23,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:23,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:23,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:23,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:23,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:23,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ee5f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23, skipping insertion in model container [2025-01-09 14:47:23,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:23,507 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_operatoramount_amount500_file-48.i[916,929] [2025-01-09 14:47:23,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:23,702 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:23,711 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_operatoramount_amount500_file-48.i[916,929] [2025-01-09 14:47:23,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:23,811 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:23,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23 WrapperNode [2025-01-09 14:47:23,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:23,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:23,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:23,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:23,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,872 INFO L138 Inliner]: procedures = 26, calls = 96, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 767 [2025-01-09 14:47:23,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:23,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:23,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:23,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:23,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,916 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-01-09 14:47:23,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:23,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:23,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:23,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:23,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (1/1) ... [2025-01-09 14:47:23,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:23,975 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-01-09 14:47:23,982 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-01-09 14:47:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:23,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:23,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:23,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:24,105 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:24,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:25,056 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:25,056 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:25,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:25,074 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:25,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:25 BoogieIcfgContainer [2025-01-09 14:47:25,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:25,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:25,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:25,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:25,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:23" (1/3) ... [2025-01-09 14:47:25,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4406033b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:25, skipping insertion in model container [2025-01-09 14:47:25,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:23" (2/3) ... [2025-01-09 14:47:25,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4406033b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:25, skipping insertion in model container [2025-01-09 14:47:25,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:25" (3/3) ... [2025-01-09 14:47:25,082 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-48.i [2025-01-09 14:47:25,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:25,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-48.i that has 2 procedures, 306 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:25,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:25,144 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;@7316efc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:25,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 220 states have (on average 1.5363636363636364) internal successors, (338), 221 states have internal predecessors, (338), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:47:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-01-09 14:47:25,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:25,171 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:25,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:25,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash -894309609, now seen corresponding path program 1 times [2025-01-09 14:47:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739440900] [2025-01-09 14:47:25,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:25,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-01-09 14:47:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-01-09 14:47:25,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:25,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-01-09 14:47:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:25,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739440900] [2025-01-09 14:47:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739440900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285240589] [2025-01-09 14:47:25,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:25,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:25,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:25,770 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-01-09 14:47:25,772 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-01-09 14:47:25,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-01-09 14:47:26,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-01-09 14:47:26,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:26,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:26,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:26,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-01-09 14:47:26,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285240589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565647704] [2025-01-09 14:47:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:26,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:26,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:26,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:26,188 INFO L87 Difference]: Start difference. First operand has 306 states, 220 states have (on average 1.5363636363636364) internal successors, (338), 221 states have internal predecessors, (338), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-01-09 14:47:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:26,244 INFO L93 Difference]: Finished difference Result 606 states and 1086 transitions. [2025-01-09 14:47:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:26,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) Word has length 544 [2025-01-09 14:47:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:26,259 INFO L225 Difference]: With dead ends: 606 [2025-01-09 14:47:26,259 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 14:47:26,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 545 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-01-09 14:47:26,270 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:26,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 14:47:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-01-09 14:47:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.5229357798165137) internal successors, (332), 218 states have internal predecessors, (332), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:47:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 498 transitions. [2025-01-09 14:47:26,343 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 498 transitions. Word has length 544 [2025-01-09 14:47:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:26,344 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 498 transitions. [2025-01-09 14:47:26,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-01-09 14:47:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 498 transitions. [2025-01-09 14:47:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-01-09 14:47:26,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:26,354 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:26,363 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-01-09 14:47:26,557 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-01-09 14:47:26,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1357510867, now seen corresponding path program 1 times [2025-01-09 14:47:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982350567] [2025-01-09 14:47:26,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:26,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-01-09 14:47:26,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-01-09 14:47:26,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982350567] [2025-01-09 14:47:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982350567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:26,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:26,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854483603] [2025-01-09 14:47:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:26,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:26,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:26,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:26,999 INFO L87 Difference]: Start difference. First operand 303 states and 498 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:27,146 INFO L93 Difference]: Finished difference Result 893 states and 1468 transitions. [2025-01-09 14:47:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 544 [2025-01-09 14:47:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:27,157 INFO L225 Difference]: With dead ends: 893 [2025-01-09 14:47:27,159 INFO L226 Difference]: Without dead ends: 593 [2025-01-09 14:47:27,161 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-01-09 14:47:27,161 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 454 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:27,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1326 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-09 14:47:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 358. [2025-01-09 14:47:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 273 states have (on average 1.5494505494505495) internal successors, (423), 273 states have internal predecessors, (423), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:47:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 589 transitions. [2025-01-09 14:47:27,206 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 589 transitions. Word has length 544 [2025-01-09 14:47:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:27,208 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 589 transitions. [2025-01-09 14:47:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 589 transitions. [2025-01-09 14:47:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:47:27,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:27,211 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:27,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:27,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:27,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash 596978333, now seen corresponding path program 1 times [2025-01-09 14:47:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:27,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148297696] [2025-01-09 14:47:27,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:27,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:47:27,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:47:27,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:27,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148297696] [2025-01-09 14:47:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148297696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559705668] [2025-01-09 14:47:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:27,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:27,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:27,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:27,669 INFO L87 Difference]: Start difference. First operand 358 states and 589 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:27,749 INFO L93 Difference]: Finished difference Result 991 states and 1633 transitions. [2025-01-09 14:47:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 545 [2025-01-09 14:47:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:27,759 INFO L225 Difference]: With dead ends: 991 [2025-01-09 14:47:27,759 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 14:47:27,760 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-01-09 14:47:27,760 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 334 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:27,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1246 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 14:47:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2025-01-09 14:47:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 506 states have (on average 1.5711462450592886) internal successors, (795), 507 states have internal predecessors, (795), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:47:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1043 transitions. [2025-01-09 14:47:27,813 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1043 transitions. Word has length 545 [2025-01-09 14:47:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:27,814 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1043 transitions. [2025-01-09 14:47:27,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1043 transitions. [2025-01-09 14:47:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:47:27,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:27,823 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:27,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:27,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash 673879131, now seen corresponding path program 1 times [2025-01-09 14:47:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:27,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510111155] [2025-01-09 14:47:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:27,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:47:27,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:47:27,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:27,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:28,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510111155] [2025-01-09 14:47:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510111155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:28,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:28,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828646329] [2025-01-09 14:47:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:28,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:28,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:28,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:28,222 INFO L87 Difference]: Start difference. First operand 633 states and 1043 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:28,318 INFO L93 Difference]: Finished difference Result 1263 states and 2083 transitions. [2025-01-09 14:47:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:28,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 545 [2025-01-09 14:47:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:28,326 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 14:47:28,327 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 14:47:28,328 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-01-09 14:47:28,329 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 317 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 454 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-01-09 14:47:28,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 454 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 14:47:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-01-09 14:47:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 506 states have (on average 1.5632411067193677) internal successors, (791), 507 states have internal predecessors, (791), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:47:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1039 transitions. [2025-01-09 14:47:28,385 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1039 transitions. Word has length 545 [2025-01-09 14:47:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:28,387 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 1039 transitions. [2025-01-09 14:47:28,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1039 transitions. [2025-01-09 14:47:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-01-09 14:47:28,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:28,393 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:28,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:28,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:28,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:28,394 INFO L85 PathProgramCache]: Analyzing trace with hash 723335257, now seen corresponding path program 1 times [2025-01-09 14:47:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:28,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719894734] [2025-01-09 14:47:28,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:28,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:28,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-01-09 14:47:28,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-01-09 14:47:28,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:28,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719894734] [2025-01-09 14:47:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719894734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:28,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006234246] [2025-01-09 14:47:28,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:28,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:28,658 INFO L87 Difference]: Start difference. First operand 633 states and 1039 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, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:28,766 INFO L93 Difference]: Finished difference Result 1712 states and 2797 transitions. [2025-01-09 14:47:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:28,767 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, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 546 [2025-01-09 14:47:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:28,775 INFO L225 Difference]: With dead ends: 1712 [2025-01-09 14:47:28,775 INFO L226 Difference]: Without dead ends: 1082 [2025-01-09 14:47:28,777 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-01-09 14:47:28,777 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 408 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:28,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1247 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-01-09 14:47:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 807. [2025-01-09 14:47:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 680 states have (on average 1.575) internal successors, (1071), 681 states have internal predecessors, (1071), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:47:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1319 transitions. [2025-01-09 14:47:28,849 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1319 transitions. Word has length 546 [2025-01-09 14:47:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1319 transitions. [2025-01-09 14:47:28,851 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, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1319 transitions. [2025-01-09 14:47:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-01-09 14:47:28,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:28,857 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:28,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -239161735, now seen corresponding path program 1 times [2025-01-09 14:47:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456859492] [2025-01-09 14:47:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:28,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-01-09 14:47:28,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-01-09 14:47:28,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:28,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456859492] [2025-01-09 14:47:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456859492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:47:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998986463] [2025-01-09 14:47:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:47:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:29,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:47:29,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:29,601 INFO L87 Difference]: Start difference. First operand 807 states and 1319 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:30,175 INFO L93 Difference]: Finished difference Result 1617 states and 2645 transitions. [2025-01-09 14:47:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:47:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 547 [2025-01-09 14:47:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:30,181 INFO L225 Difference]: With dead ends: 1617 [2025-01-09 14:47:30,182 INFO L226 Difference]: Without dead ends: 813 [2025-01-09 14:47:30,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:30,184 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 806 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:30,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1110 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-01-09 14:47:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 811. [2025-01-09 14:47:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 684 states have (on average 1.5716374269005848) internal successors, (1075), 685 states have internal predecessors, (1075), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:47:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1323 transitions. [2025-01-09 14:47:30,232 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1323 transitions. Word has length 547 [2025-01-09 14:47:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:30,233 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1323 transitions. [2025-01-09 14:47:30,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1323 transitions. [2025-01-09 14:47:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-09 14:47:30,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:30,239 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:30,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:30,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 10479652, now seen corresponding path program 1 times [2025-01-09 14:47:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:30,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575657094] [2025-01-09 14:47:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:30,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 14:47:30,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 14:47:30,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:30,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:30,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575657094] [2025-01-09 14:47:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575657094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:30,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:30,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032769662] [2025-01-09 14:47:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:30,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:30,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:30,716 INFO L87 Difference]: Start difference. First operand 811 states and 1323 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:30,839 INFO L93 Difference]: Finished difference Result 2427 states and 3963 transitions. [2025-01-09 14:47:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 548 [2025-01-09 14:47:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:30,847 INFO L225 Difference]: With dead ends: 2427 [2025-01-09 14:47:30,847 INFO L226 Difference]: Without dead ends: 1619 [2025-01-09 14:47:30,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:30,850 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 283 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:30,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1400 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-01-09 14:47:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1601. [2025-01-09 14:47:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1348 states have (on average 1.5652818991097923) internal successors, (2110), 1350 states have internal predecessors, (2110), 248 states have call successors, (248), 4 states have call predecessors, (248), 4 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-01-09 14:47:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2606 transitions. [2025-01-09 14:47:30,919 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2606 transitions. Word has length 548 [2025-01-09 14:47:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2606 transitions. [2025-01-09 14:47:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2606 transitions. [2025-01-09 14:47:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 14:47:30,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:30,924 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:47:30,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 261094378, now seen corresponding path program 1 times [2025-01-09 14:47:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734115980] [2025-01-09 14:47:30,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 14:47:31,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 14:47:31,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:31,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:31,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734115980] [2025-01-09 14:47:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734115980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:31,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241827208] [2025-01-09 14:47:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:31,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:31,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:31,988 INFO L87 Difference]: Start difference. First operand 1601 states and 2606 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:32,519 INFO L93 Difference]: Finished difference Result 6105 states and 9927 transitions. [2025-01-09 14:47:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:32,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-01-09 14:47:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:32,537 INFO L225 Difference]: With dead ends: 6105 [2025-01-09 14:47:32,537 INFO L226 Difference]: Without dead ends: 4507 [2025-01-09 14:47:32,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:32,541 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 913 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:32,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1424 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-01-09 14:47:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4115. [2025-01-09 14:47:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4115 states, 3666 states have (on average 1.5837424986361157) internal successors, (5806), 3672 states have internal predecessors, (5806), 440 states have call successors, (440), 8 states have call predecessors, (440), 8 states have return successors, (440), 434 states have call predecessors, (440), 440 states have call successors, (440) [2025-01-09 14:47:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 6686 transitions. [2025-01-09 14:47:32,687 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 6686 transitions. Word has length 549 [2025-01-09 14:47:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:32,688 INFO L471 AbstractCegarLoop]: Abstraction has 4115 states and 6686 transitions. [2025-01-09 14:47:32,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 6686 transitions. [2025-01-09 14:47:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 14:47:32,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:32,695 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:32,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:32,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:32,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 501334124, now seen corresponding path program 1 times [2025-01-09 14:47:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:32,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815475718] [2025-01-09 14:47:32,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:32,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 14:47:32,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 14:47:32,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:32,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815475718] [2025-01-09 14:47:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815475718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:32,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397299740] [2025-01-09 14:47:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:32,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:32,907 INFO L87 Difference]: Start difference. First operand 4115 states and 6686 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:33,087 INFO L93 Difference]: Finished difference Result 10841 states and 17548 transitions. [2025-01-09 14:47:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-01-09 14:47:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:33,112 INFO L225 Difference]: With dead ends: 10841 [2025-01-09 14:47:33,112 INFO L226 Difference]: Without dead ends: 6729 [2025-01-09 14:47:33,119 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-01-09 14:47:33,120 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 417 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:33,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1277 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2025-01-09 14:47:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 6727. [2025-01-09 14:47:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6727 states, 5830 states have (on average 1.5530017152658662) internal successors, (9054), 5842 states have internal predecessors, (9054), 880 states have call successors, (880), 16 states have call predecessors, (880), 16 states have return successors, (880), 868 states have call predecessors, (880), 880 states have call successors, (880) [2025-01-09 14:47:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6727 states to 6727 states and 10814 transitions. [2025-01-09 14:47:33,474 INFO L78 Accepts]: Start accepts. Automaton has 6727 states and 10814 transitions. Word has length 549 [2025-01-09 14:47:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:33,474 INFO L471 AbstractCegarLoop]: Abstraction has 6727 states and 10814 transitions. [2025-01-09 14:47:33,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6727 states and 10814 transitions. [2025-01-09 14:47:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 14:47:33,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:33,492 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:33,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:33,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:33,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:33,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1492810582, now seen corresponding path program 1 times [2025-01-09 14:47:33,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:33,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131604413] [2025-01-09 14:47:33,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:33,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:33,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 14:47:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 14:47:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131604413] [2025-01-09 14:47:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131604413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962458485] [2025-01-09 14:47:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:34,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:34,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:34,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:34,554 INFO L87 Difference]: Start difference. First operand 6727 states and 10814 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:35,368 INFO L93 Difference]: Finished difference Result 18749 states and 30021 transitions. [2025-01-09 14:47:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-01-09 14:47:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:35,447 INFO L225 Difference]: With dead ends: 18749 [2025-01-09 14:47:35,447 INFO L226 Difference]: Without dead ends: 12025 [2025-01-09 14:47:35,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:35,494 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 664 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:35,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1435 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12025 states. [2025-01-09 14:47:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12025 to 7827. [2025-01-09 14:47:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7827 states, 6930 states have (on average 1.5766233766233766) internal successors, (10926), 6942 states have internal predecessors, (10926), 880 states have call successors, (880), 16 states have call predecessors, (880), 16 states have return successors, (880), 868 states have call predecessors, (880), 880 states have call successors, (880) [2025-01-09 14:47:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 12686 transitions. [2025-01-09 14:47:35,965 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 12686 transitions. Word has length 549 [2025-01-09 14:47:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:35,966 INFO L471 AbstractCegarLoop]: Abstraction has 7827 states and 12686 transitions. [2025-01-09 14:47:35,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 12686 transitions. [2025-01-09 14:47:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 14:47:35,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:35,977 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:35,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:47:35,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1519876184, now seen corresponding path program 1 times [2025-01-09 14:47:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706300525] [2025-01-09 14:47:35,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:36,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 14:47:36,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 14:47:36,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:36,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706300525] [2025-01-09 14:47:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706300525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488565991] [2025-01-09 14:47:36,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:36,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:36,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:36,354 INFO L87 Difference]: Start difference. First operand 7827 states and 12686 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:36,903 INFO L93 Difference]: Finished difference Result 18971 states and 30657 transitions. [2025-01-09 14:47:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:47:36,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 549 [2025-01-09 14:47:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:36,931 INFO L225 Difference]: With dead ends: 18971 [2025-01-09 14:47:36,931 INFO L226 Difference]: Without dead ends: 11147 [2025-01-09 14:47:36,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:36,942 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 686 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:36,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2189 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2025-01-09 14:47:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 9705. [2025-01-09 14:47:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9705 states, 8440 states have (on average 1.5639810426540284) internal successors, (13200), 8454 states have internal predecessors, (13200), 1239 states have call successors, (1239), 25 states have call predecessors, (1239), 25 states have return successors, (1239), 1225 states have call predecessors, (1239), 1239 states have call successors, (1239) [2025-01-09 14:47:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9705 states to 9705 states and 15678 transitions. [2025-01-09 14:47:37,374 INFO L78 Accepts]: Start accepts. Automaton has 9705 states and 15678 transitions. Word has length 549 [2025-01-09 14:47:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 9705 states and 15678 transitions. [2025-01-09 14:47:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:47:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9705 states and 15678 transitions. [2025-01-09 14:47:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 14:47:37,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:37,382 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:47:37,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2003621763, now seen corresponding path program 1 times [2025-01-09 14:47:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423683573] [2025-01-09 14:47:37,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:37,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 14:47:38,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 14:47:38,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:38,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 105 proven. 141 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-01-09 14:47:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423683573] [2025-01-09 14:47:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423683573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671084504] [2025-01-09 14:47:38,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:38,997 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-01-09 14:47:39,007 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-01-09 14:47:39,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 14:47:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 14:47:39,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:39,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:39,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:47:39,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6732 proven. 141 refuted. 0 times theorem prover too weak. 6739 trivial. 0 not checked. [2025-01-09 14:47:40,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 105 proven. 141 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-01-09 14:47:41,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671084504] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:41,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:41,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2025-01-09 14:47:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586066920] [2025-01-09 14:47:41,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:41,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:47:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:41,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:47:41,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:47:41,414 INFO L87 Difference]: Start difference. First operand 9705 states and 15678 transitions. Second operand has 15 states, 15 states have (on average 21.066666666666666) internal successors, (316), 15 states have internal predecessors, (316), 5 states have call successors, (249), 3 states have call predecessors, (249), 6 states have return successors, (249), 5 states have call predecessors, (249), 5 states have call successors, (249) [2025-01-09 14:47:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:44,997 INFO L93 Difference]: Finished difference Result 58341 states and 92606 transitions. [2025-01-09 14:47:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 14:47:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 21.066666666666666) internal successors, (316), 15 states have internal predecessors, (316), 5 states have call successors, (249), 3 states have call predecessors, (249), 6 states have return successors, (249), 5 states have call predecessors, (249), 5 states have call successors, (249) Word has length 550 [2025-01-09 14:47:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:45,110 INFO L225 Difference]: With dead ends: 58341 [2025-01-09 14:47:45,110 INFO L226 Difference]: Without dead ends: 48779 [2025-01-09 14:47:45,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 1097 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=1092, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 14:47:45,133 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 2323 mSDsluCounter, 3752 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 870 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 4123 SdHoareTripleChecker+Invalid, 3771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 870 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:45,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 4123 Invalid, 3771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [870 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:47:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48779 states. [2025-01-09 14:47:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48779 to 24597. [2025-01-09 14:47:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24597 states, 22131 states have (on average 1.554516289367855) internal successors, (34403), 22159 states have internal predecessors, (34403), 2395 states have call successors, (2395), 70 states have call predecessors, (2395), 70 states have return successors, (2395), 2367 states have call predecessors, (2395), 2395 states have call successors, (2395) [2025-01-09 14:47:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24597 states to 24597 states and 39193 transitions. [2025-01-09 14:47:47,526 INFO L78 Accepts]: Start accepts. Automaton has 24597 states and 39193 transitions. Word has length 550 [2025-01-09 14:47:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:47,527 INFO L471 AbstractCegarLoop]: Abstraction has 24597 states and 39193 transitions. [2025-01-09 14:47:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.066666666666666) internal successors, (316), 15 states have internal predecessors, (316), 5 states have call successors, (249), 3 states have call predecessors, (249), 6 states have return successors, (249), 5 states have call predecessors, (249), 5 states have call successors, (249) [2025-01-09 14:47:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24597 states and 39193 transitions. [2025-01-09 14:47:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 14:47:47,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:47,540 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:47,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:47:47,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:47,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash 987614223, now seen corresponding path program 1 times [2025-01-09 14:47:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505338956] [2025-01-09 14:47:47,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:47,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 14:47:47,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 14:47:47,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:47,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505338956] [2025-01-09 14:47:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505338956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:47,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:47,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759510278] [2025-01-09 14:47:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:47,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:47,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:47,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:47,974 INFO L87 Difference]: Start difference. First operand 24597 states and 39193 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 2 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83) [2025-01-09 14:47:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:49,134 INFO L93 Difference]: Finished difference Result 49211 states and 78277 transitions. [2025-01-09 14:47:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 2 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83) Word has length 550 [2025-01-09 14:47:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:49,197 INFO L225 Difference]: With dead ends: 49211 [2025-01-09 14:47:49,197 INFO L226 Difference]: Without dead ends: 24761 [2025-01-09 14:47:49,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:49,232 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 771 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:49,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 535 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24761 states. [2025-01-09 14:47:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24761 to 24761. [2025-01-09 14:47:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24761 states, 22254 states have (on average 1.5448009346634313) internal successors, (34378), 22282 states have internal predecessors, (34378), 2395 states have call successors, (2395), 111 states have call predecessors, (2395), 111 states have return successors, (2395), 2367 states have call predecessors, (2395), 2395 states have call successors, (2395) [2025-01-09 14:47:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24761 states to 24761 states and 39168 transitions. [2025-01-09 14:47:50,274 INFO L78 Accepts]: Start accepts. Automaton has 24761 states and 39168 transitions. Word has length 550 [2025-01-09 14:47:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:50,275 INFO L471 AbstractCegarLoop]: Abstraction has 24761 states and 39168 transitions. [2025-01-09 14:47:50,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 2 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83) [2025-01-09 14:47:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 24761 states and 39168 transitions. [2025-01-09 14:47:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-01-09 14:47:50,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:50,290 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:50,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:47:50,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:50,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash 262759423, now seen corresponding path program 1 times [2025-01-09 14:47:50,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:50,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305496912] [2025-01-09 14:47:50,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:50,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 14:47:51,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 14:47:51,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:51,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 111 proven. 135 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-01-09 14:47:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305496912] [2025-01-09 14:47:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305496912] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701647593] [2025-01-09 14:47:51,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:51,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:51,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:47:52,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-01-09 14:47:52,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-01-09 14:47:52,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:52,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:52,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:47:52,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 8947 proven. 99 refuted. 0 times theorem prover too weak. 4566 trivial. 0 not checked. [2025-01-09 14:47:52,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 147 proven. 99 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-01-09 14:47:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701647593] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:53,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-09 14:47:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234546896] [2025-01-09 14:47:53,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:47:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:53,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:47:53,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:47:53,217 INFO L87 Difference]: Start difference. First operand 24761 states and 39168 transitions. Second operand has 18 states, 17 states have (on average 17.88235294117647) internal successors, (304), 18 states have internal predecessors, (304), 8 states have call successors, (230), 3 states have call predecessors, (230), 6 states have return successors, (230), 7 states have call predecessors, (230), 8 states have call successors, (230) [2025-01-09 14:47:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:55,726 INFO L93 Difference]: Finished difference Result 74444 states and 117410 transitions. [2025-01-09 14:47:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:47:55,727 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 17.88235294117647) internal successors, (304), 18 states have internal predecessors, (304), 8 states have call successors, (230), 3 states have call predecessors, (230), 6 states have return successors, (230), 7 states have call predecessors, (230), 8 states have call successors, (230) Word has length 550 [2025-01-09 14:47:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:55,826 INFO L225 Difference]: With dead ends: 74444 [2025-01-09 14:47:55,827 INFO L226 Difference]: Without dead ends: 49834 [2025-01-09 14:47:55,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1093 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:47:55,852 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2270 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:55,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 3377 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [852 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:47:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49834 states. [2025-01-09 14:47:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49834 to 49734. [2025-01-09 14:47:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49734 states, 44717 states have (on average 1.5322136994878905) internal successors, (68516), 44773 states have internal predecessors, (68516), 4707 states have call successors, (4707), 309 states have call predecessors, (4707), 309 states have return successors, (4707), 4651 states have call predecessors, (4707), 4707 states have call successors, (4707) [2025-01-09 14:47:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49734 states to 49734 states and 77930 transitions. [2025-01-09 14:47:58,135 INFO L78 Accepts]: Start accepts. Automaton has 49734 states and 77930 transitions. Word has length 550 [2025-01-09 14:47:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:58,137 INFO L471 AbstractCegarLoop]: Abstraction has 49734 states and 77930 transitions. [2025-01-09 14:47:58,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 17.88235294117647) internal successors, (304), 18 states have internal predecessors, (304), 8 states have call successors, (230), 3 states have call predecessors, (230), 6 states have return successors, (230), 7 states have call predecessors, (230), 8 states have call successors, (230) [2025-01-09 14:47:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 49734 states and 77930 transitions. [2025-01-09 14:47:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-01-09 14:47:58,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:58,161 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:58,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:47:58,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:58,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:58,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1328111374, now seen corresponding path program 1 times [2025-01-09 14:47:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906776906] [2025-01-09 14:47:58,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-01-09 14:47:58,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-01-09 14:47:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-01-09 14:47:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906776906] [2025-01-09 14:47:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906776906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716697341] [2025-01-09 14:47:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:58,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:58,743 INFO L87 Difference]: Start difference. First operand 49734 states and 77930 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:48:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:00,506 INFO L93 Difference]: Finished difference Result 81684 states and 128010 transitions. [2025-01-09 14:48:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:00,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 551 [2025-01-09 14:48:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:00,613 INFO L225 Difference]: With dead ends: 81684 [2025-01-09 14:48:00,613 INFO L226 Difference]: Without dead ends: 56973 [2025-01-09 14:48:00,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:48:00,648 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 316 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:00,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1742 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:48:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56973 states. [2025-01-09 14:48:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56973 to 49729. [2025-01-09 14:48:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49729 states, 44712 states have (on average 1.5321837538021112) internal successors, (68507), 44768 states have internal predecessors, (68507), 4707 states have call successors, (4707), 309 states have call predecessors, (4707), 309 states have return successors, (4707), 4651 states have call predecessors, (4707), 4707 states have call successors, (4707) [2025-01-09 14:48:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49729 states to 49729 states and 77921 transitions. [2025-01-09 14:48:02,288 INFO L78 Accepts]: Start accepts. Automaton has 49729 states and 77921 transitions. Word has length 551 [2025-01-09 14:48:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 49729 states and 77921 transitions. [2025-01-09 14:48:02,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-01-09 14:48:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 49729 states and 77921 transitions. [2025-01-09 14:48:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-01-09 14:48:02,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:02,299 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:48:02,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2082654867, now seen corresponding path program 1 times [2025-01-09 14:48:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327341723] [2025-01-09 14:48:02,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:02,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-01-09 14:48:03,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-01-09 14:48:03,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:03,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:48:03,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118965570] [2025-01-09 14:48:03,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:03,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:03,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:03,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:48:03,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:48:03,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-01-09 14:48:03,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-01-09 14:48:03,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:03,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:03,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:48:03,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 2294 proven. 447 refuted. 0 times theorem prover too weak. 10871 trivial. 0 not checked. [2025-01-09 14:48:05,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327341723] [2025-01-09 14:48:07,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:48:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118965570] [2025-01-09 14:48:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118965570] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:07,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:48:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 14:48:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796764795] [2025-01-09 14:48:07,398 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:07,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:48:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:07,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:48:07,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:48:07,399 INFO L87 Difference]: Start difference. First operand 49729 states and 77921 transitions. Second operand has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 3 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) [2025-01-09 14:48:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:10,121 INFO L93 Difference]: Finished difference Result 100369 states and 156429 transitions. [2025-01-09 14:48:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:48:10,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 3 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) Word has length 552 [2025-01-09 14:48:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:10,291 INFO L225 Difference]: With dead ends: 100369 [2025-01-09 14:48:10,291 INFO L226 Difference]: Without dead ends: 50799 [2025-01-09 14:48:10,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:48:10,330 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 275 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:10,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1424 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:48:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50799 states. [2025-01-09 14:48:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50799 to 50701. [2025-01-09 14:48:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50701 states, 45441 states have (on average 1.518716577540107) internal successors, (69012), 45497 states have internal predecessors, (69012), 4707 states have call successors, (4707), 552 states have call predecessors, (4707), 552 states have return successors, (4707), 4651 states have call predecessors, (4707), 4707 states have call successors, (4707) [2025-01-09 14:48:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50701 states to 50701 states and 78426 transitions. [2025-01-09 14:48:12,413 INFO L78 Accepts]: Start accepts. Automaton has 50701 states and 78426 transitions. Word has length 552 [2025-01-09 14:48:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:12,414 INFO L471 AbstractCegarLoop]: Abstraction has 50701 states and 78426 transitions. [2025-01-09 14:48:12,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 3 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (83), 3 states have call predecessors, (83), 3 states have call successors, (83) [2025-01-09 14:48:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 50701 states and 78426 transitions. [2025-01-09 14:48:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-01-09 14:48:12,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:12,423 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:12,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:48:12,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:48:12,624 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:12,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2028261969, now seen corresponding path program 1 times [2025-01-09 14:48:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642161285] [2025-01-09 14:48:12,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:12,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-01-09 14:48:13,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-01-09 14:48:13,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:13,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 99 proven. 147 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-01-09 14:48:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642161285] [2025-01-09 14:48:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642161285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904315249] [2025-01-09 14:48:14,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:14,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:48:14,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:48:14,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-01-09 14:48:14,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-01-09 14:48:14,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:14,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:14,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:48:14,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 7448 proven. 324 refuted. 0 times theorem prover too weak. 5840 trivial. 0 not checked. [2025-01-09 14:48:16,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 162 proven. 327 refuted. 0 times theorem prover too weak. 13123 trivial. 0 not checked. [2025-01-09 14:48:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904315249] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:17,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:17,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 25 [2025-01-09 14:48:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260983641] [2025-01-09 14:48:17,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 14:48:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:17,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 14:48:17,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:48:17,340 INFO L87 Difference]: Start difference. First operand 50701 states and 78426 transitions. Second operand has 25 states, 25 states have (on average 13.76) internal successors, (344), 25 states have internal predecessors, (344), 8 states have call successors, (249), 4 states have call predecessors, (249), 9 states have return successors, (249), 8 states have call predecessors, (249), 8 states have call successors, (249) [2025-01-09 14:48:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:23,962 INFO L93 Difference]: Finished difference Result 159425 states and 246346 transitions. [2025-01-09 14:48:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 14:48:23,963 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 13.76) internal successors, (344), 25 states have internal predecessors, (344), 8 states have call successors, (249), 4 states have call predecessors, (249), 9 states have return successors, (249), 8 states have call predecessors, (249), 8 states have call successors, (249) Word has length 552 [2025-01-09 14:48:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:24,228 INFO L225 Difference]: With dead ends: 159425 [2025-01-09 14:48:24,228 INFO L226 Difference]: Without dead ends: 108895 [2025-01-09 14:48:24,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1094 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=612, Invalid=1740, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 14:48:24,314 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 2596 mSDsluCounter, 5673 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2630 SdHoareTripleChecker+Valid, 6072 SdHoareTripleChecker+Invalid, 4967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:24,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2630 Valid, 6072 Invalid, 4967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 14:48:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108895 states.