./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.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-46.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 df69ef27b04a763c9eae25d4c49e492a4abf0cf87271d0ce91cfba82e7749765 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:13,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:14,009 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:14,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:14,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:14,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:14,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:14,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:14,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:14,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:14,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:14,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:14,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:14,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:14,042 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:14,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:14,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:14,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:14,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:14,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:14,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:14,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:14,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:14,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:14,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:14,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:14,045 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 -> df69ef27b04a763c9eae25d4c49e492a4abf0cf87271d0ce91cfba82e7749765 [2025-01-09 14:47:14,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:14,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:14,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:14,258 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:14,258 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:14,258 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-46.i [2025-01-09 14:47:15,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/946f9ac7e/3b1aa7221f0f4c7e9451f86f5200b354/FLAGad1af3ff5 [2025-01-09 14:47:15,650 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:15,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.i [2025-01-09 14:47:15,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/946f9ac7e/3b1aa7221f0f4c7e9451f86f5200b354/FLAGad1af3ff5 [2025-01-09 14:47:15,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/946f9ac7e/3b1aa7221f0f4c7e9451f86f5200b354 [2025-01-09 14:47:15,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:15,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:15,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:15,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:15,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:15,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:15" (1/1) ... [2025-01-09 14:47:15,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:15, skipping insertion in model container [2025-01-09 14:47:15,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:15" (1/1) ... [2025-01-09 14:47:15,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:16,044 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-46.i[916,929] [2025-01-09 14:47:16,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:16,211 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:16,218 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-46.i[916,929] [2025-01-09 14:47:16,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:16,342 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:16,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:16 WrapperNode [2025-01-09 14:47:16,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:16,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:16,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:16,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:16,348 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:16" (1/1) ... [2025-01-09 14:47:16,372 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:16" (1/1) ... [2025-01-09 14:47:16,522 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 740 [2025-01-09 14:47:16,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:16,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:16,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:16,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:16,533 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:16" (1/1) ... [2025-01-09 14:47:16,534 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:16" (1/1) ... [2025-01-09 14:47:16,558 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:16" (1/1) ... [2025-01-09 14:47:16,673 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:16,674 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:16" (1/1) ... [2025-01-09 14:47:16,674 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:16" (1/1) ... [2025-01-09 14:47:16,705 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:16" (1/1) ... [2025-01-09 14:47:16,716 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:16" (1/1) ... [2025-01-09 14:47:16,724 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:16" (1/1) ... [2025-01-09 14:47:16,739 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:16" (1/1) ... [2025-01-09 14:47:16,744 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:16" (1/1) ... [2025-01-09 14:47:16,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:16,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:16,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:16,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:16,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:16" (1/1) ... [2025-01-09 14:47:16,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:16,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:16,794 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:16,801 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:16,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:16,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:16,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:16,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:16,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:16,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:16,906 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:16,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:18,052 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:18,052 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:18,069 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:18,069 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:18,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:18 BoogieIcfgContainer [2025-01-09 14:47:18,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:18,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:18,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:18,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:18,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:15" (1/3) ... [2025-01-09 14:47:18,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b641c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:18, skipping insertion in model container [2025-01-09 14:47:18,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:16" (2/3) ... [2025-01-09 14:47:18,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b641c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:18, skipping insertion in model container [2025-01-09 14:47:18,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:18" (3/3) ... [2025-01-09 14:47:18,079 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-46.i [2025-01-09 14:47:18,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:18,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-46.i that has 2 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:18,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:18,159 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;@a209713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:18,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 221 states have internal predecessors, (336), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 14:47:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:47:18,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:18,181 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1585994221, now seen corresponding path program 1 times [2025-01-09 14:47:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62912526] [2025-01-09 14:47:18,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:47:18,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:47:18,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:18,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-01-09 14:47:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62912526] [2025-01-09 14:47:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62912526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342307870] [2025-01-09 14:47:18,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:18,717 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:18,719 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:18,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:47:19,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:47:19,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:19,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:19,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:19,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-01-09 14:47:19,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342307870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:19,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658966393] [2025-01-09 14:47:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:19,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:19,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:19,130 INFO L87 Difference]: Start difference. First operand has 298 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 221 states have internal predecessors, (336), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 14:47:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:19,168 INFO L93 Difference]: Finished difference Result 590 states and 1042 transitions. [2025-01-09 14:47:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 520 [2025-01-09 14:47:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:19,176 INFO L225 Difference]: With dead ends: 590 [2025-01-09 14:47:19,176 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 14:47:19,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 521 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:19,185 INFO L435 NwaCegarLoop]: 481 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, 481 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:19,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 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:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 14:47:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-01-09 14:47:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.518348623853211) internal successors, (331), 218 states have internal predecessors, (331), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 14:47:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 481 transitions. [2025-01-09 14:47:19,235 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 481 transitions. Word has length 520 [2025-01-09 14:47:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 481 transitions. [2025-01-09 14:47:19,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-01-09 14:47:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 481 transitions. [2025-01-09 14:47:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:47:19,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:19,258 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,267 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:19,462 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:19,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1998054473, now seen corresponding path program 1 times [2025-01-09 14:47:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:19,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250299952] [2025-01-09 14:47:19,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:19,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:47:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:47:19,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:19,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250299952] [2025-01-09 14:47:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250299952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:20,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566065951] [2025-01-09 14:47:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:20,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:20,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:20,128 INFO L87 Difference]: Start difference. First operand 295 states and 481 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:20,252 INFO L93 Difference]: Finished difference Result 779 states and 1267 transitions. [2025-01-09 14:47:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-01-09 14:47:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:20,263 INFO L225 Difference]: With dead ends: 779 [2025-01-09 14:47:20,264 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 14:47:20,265 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:20,266 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 274 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:20,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 930 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 14:47:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 484. [2025-01-09 14:47:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 370 states have (on average 1.518918918918919) internal successors, (562), 371 states have internal predecessors, (562), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-01-09 14:47:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 784 transitions. [2025-01-09 14:47:20,325 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 784 transitions. Word has length 520 [2025-01-09 14:47:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:20,327 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 784 transitions. [2025-01-09 14:47:20,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 784 transitions. [2025-01-09 14:47:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:47:20,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:20,335 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:20,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -626103689, now seen corresponding path program 1 times [2025-01-09 14:47:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521969779] [2025-01-09 14:47:20,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:20,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:47:20,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:47:20,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:20,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521969779] [2025-01-09 14:47:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521969779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265128970] [2025-01-09 14:47:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:20,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:20,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:20,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:20,809 INFO L87 Difference]: Start difference. First operand 484 states and 784 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:20,942 INFO L93 Difference]: Finished difference Result 1442 states and 2338 transitions. [2025-01-09 14:47:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-01-09 14:47:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:20,955 INFO L225 Difference]: With dead ends: 1442 [2025-01-09 14:47:20,956 INFO L226 Difference]: Without dead ends: 961 [2025-01-09 14:47:20,958 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:20,959 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 420 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:20,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 937 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-09 14:47:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 638. [2025-01-09 14:47:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 524 states have (on average 1.5744274809160306) internal successors, (825), 525 states have internal predecessors, (825), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-01-09 14:47:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1047 transitions. [2025-01-09 14:47:21,032 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1047 transitions. Word has length 520 [2025-01-09 14:47:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:21,034 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 1047 transitions. [2025-01-09 14:47:21,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1047 transitions. [2025-01-09 14:47:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:47:21,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:21,045 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:21,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash -70690689, now seen corresponding path program 1 times [2025-01-09 14:47:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646484705] [2025-01-09 14:47:21,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:21,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:47:21,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:47:21,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:21,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646484705] [2025-01-09 14:47:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646484705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911415478] [2025-01-09 14:47:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:21,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:21,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:21,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:21,684 INFO L87 Difference]: Start difference. First operand 638 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:21,819 INFO L93 Difference]: Finished difference Result 1908 states and 3135 transitions. [2025-01-09 14:47:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:21,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-01-09 14:47:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:21,827 INFO L225 Difference]: With dead ends: 1908 [2025-01-09 14:47:21,828 INFO L226 Difference]: Without dead ends: 1273 [2025-01-09 14:47:21,832 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:21,834 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 461 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:21,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 914 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-01-09 14:47:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1267. [2025-01-09 14:47:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1040 states have (on average 1.5711538461538461) internal successors, (1634), 1042 states have internal predecessors, (1634), 222 states have call successors, (222), 4 states have call predecessors, (222), 4 states have return successors, (222), 220 states have call predecessors, (222), 222 states have call successors, (222) [2025-01-09 14:47:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 2078 transitions. [2025-01-09 14:47:21,940 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 2078 transitions. Word has length 520 [2025-01-09 14:47:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 2078 transitions. [2025-01-09 14:47:21,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2078 transitions. [2025-01-09 14:47:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:47:21,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:21,947 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:21,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 323676097, now seen corresponding path program 1 times [2025-01-09 14:47:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706192563] [2025-01-09 14:47:21,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:21,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:21,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:47:22,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:47:22,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:22,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706192563] [2025-01-09 14:47:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706192563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:22,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:22,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289515437] [2025-01-09 14:47:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:22,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:22,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:22,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:22,858 INFO L87 Difference]: Start difference. First operand 1267 states and 2078 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:23,202 INFO L93 Difference]: Finished difference Result 4651 states and 7645 transitions. [2025-01-09 14:47:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-01-09 14:47:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:23,218 INFO L225 Difference]: With dead ends: 4651 [2025-01-09 14:47:23,218 INFO L226 Difference]: Without dead ends: 3387 [2025-01-09 14:47:23,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:23,223 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 609 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:23,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1655 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-01-09 14:47:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 2529. [2025-01-09 14:47:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2076 states have (on average 1.569364161849711) internal successors, (3258), 2080 states have internal predecessors, (3258), 444 states have call successors, (444), 8 states have call predecessors, (444), 8 states have return successors, (444), 440 states have call predecessors, (444), 444 states have call successors, (444) [2025-01-09 14:47:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 4146 transitions. [2025-01-09 14:47:23,377 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 4146 transitions. Word has length 520 [2025-01-09 14:47:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 4146 transitions. [2025-01-09 14:47:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 4146 transitions. [2025-01-09 14:47:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:23,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:23,386 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:23,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:23,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash -971163734, now seen corresponding path program 1 times [2025-01-09 14:47:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681769208] [2025-01-09 14:47:23,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:23,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:24,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:24,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:24,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:25,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681769208] [2025-01-09 14:47:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681769208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:25,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506559331] [2025-01-09 14:47:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:25,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:25,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:25,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:25,083 INFO L87 Difference]: Start difference. First operand 2529 states and 4146 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:25,817 INFO L93 Difference]: Finished difference Result 8309 states and 13595 transitions. [2025-01-09 14:47:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:25,842 INFO L225 Difference]: With dead ends: 8309 [2025-01-09 14:47:25,843 INFO L226 Difference]: Without dead ends: 5783 [2025-01-09 14:47:25,847 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:25,848 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 915 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:25,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1173 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:47:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5783 states. [2025-01-09 14:47:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5783 to 4975. [2025-01-09 14:47:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4975 states, 4218 states have (on average 1.5746799431009957) internal successors, (6642), 4230 states have internal predecessors, (6642), 740 states have call successors, (740), 16 states have call predecessors, (740), 16 states have return successors, (740), 728 states have call predecessors, (740), 740 states have call successors, (740) [2025-01-09 14:47:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4975 states to 4975 states and 8122 transitions. [2025-01-09 14:47:26,059 INFO L78 Accepts]: Start accepts. Automaton has 4975 states and 8122 transitions. Word has length 521 [2025-01-09 14:47:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:26,060 INFO L471 AbstractCegarLoop]: Abstraction has 4975 states and 8122 transitions. [2025-01-09 14:47:26,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4975 states and 8122 transitions. [2025-01-09 14:47:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:26,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:26,070 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:26,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1656772374, now seen corresponding path program 1 times [2025-01-09 14:47:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:26,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389108288] [2025-01-09 14:47:26,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:26,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:26,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:26,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:26,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:26,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389108288] [2025-01-09 14:47:26,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389108288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:26,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:26,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938918646] [2025-01-09 14:47:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:26,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:26,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:26,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:26,269 INFO L87 Difference]: Start difference. First operand 4975 states and 8122 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:26,514 INFO L93 Difference]: Finished difference Result 9965 states and 16274 transitions. [2025-01-09 14:47:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:26,552 INFO L225 Difference]: With dead ends: 9965 [2025-01-09 14:47:26,553 INFO L226 Difference]: Without dead ends: 7321 [2025-01-09 14:47:26,561 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:26,561 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 454 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1194 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:26,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1194 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:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7321 states. [2025-01-09 14:47:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7321 to 7319. [2025-01-09 14:47:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7319 states, 6184 states have (on average 1.5688874514877102) internal successors, (9702), 6202 states have internal predecessors, (9702), 1110 states have call successors, (1110), 24 states have call predecessors, (1110), 24 states have return successors, (1110), 1092 states have call predecessors, (1110), 1110 states have call successors, (1110) [2025-01-09 14:47:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7319 states to 7319 states and 11922 transitions. [2025-01-09 14:47:26,862 INFO L78 Accepts]: Start accepts. Automaton has 7319 states and 11922 transitions. Word has length 521 [2025-01-09 14:47:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:26,862 INFO L471 AbstractCegarLoop]: Abstraction has 7319 states and 11922 transitions. [2025-01-09 14:47:26,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7319 states and 11922 transitions. [2025-01-09 14:47:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:26,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:26,872 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:47:26,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1250207468, now seen corresponding path program 1 times [2025-01-09 14:47:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194898626] [2025-01-09 14:47:26,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:27,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:27,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:28,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:28,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194898626] [2025-01-09 14:47:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194898626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:28,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767415298] [2025-01-09 14:47:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:28,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:28,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:28,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:28,087 INFO L87 Difference]: Start difference. First operand 7319 states and 11922 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:28,796 INFO L93 Difference]: Finished difference Result 18308 states and 29817 transitions. [2025-01-09 14:47:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:28,839 INFO L225 Difference]: With dead ends: 18308 [2025-01-09 14:47:28,839 INFO L226 Difference]: Without dead ends: 10992 [2025-01-09 14:47:28,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:28,852 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 302 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:28,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1205 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:47:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2025-01-09 14:47:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 10962. [2025-01-09 14:47:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10962 states, 9260 states have (on average 1.5644708423326135) internal successors, (14487), 9287 states have internal predecessors, (14487), 1665 states have call successors, (1665), 36 states have call predecessors, (1665), 36 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-01-09 14:47:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 17817 transitions. [2025-01-09 14:47:29,317 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 17817 transitions. Word has length 521 [2025-01-09 14:47:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:29,319 INFO L471 AbstractCegarLoop]: Abstraction has 10962 states and 17817 transitions. [2025-01-09 14:47:29,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 17817 transitions. [2025-01-09 14:47:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:29,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:29,332 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:29,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:29,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1116487126, now seen corresponding path program 1 times [2025-01-09 14:47:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706037085] [2025-01-09 14:47:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:29,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:29,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:29,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:29,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706037085] [2025-01-09 14:47:29,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706037085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:29,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:29,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555956861] [2025-01-09 14:47:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:29,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:29,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:29,835 INFO L87 Difference]: Start difference. First operand 10962 states and 17817 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:30,346 INFO L93 Difference]: Finished difference Result 29165 states and 47406 transitions. [2025-01-09 14:47:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:30,403 INFO L225 Difference]: With dead ends: 29165 [2025-01-09 14:47:30,403 INFO L226 Difference]: Without dead ends: 18206 [2025-01-09 14:47:30,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:30,428 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 285 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:30,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 939 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18206 states. [2025-01-09 14:47:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18206 to 18204. [2025-01-09 14:47:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18204 states, 15368 states have (on average 1.545614263404477) internal successors, (23753), 15413 states have internal predecessors, (23753), 2775 states have call successors, (2775), 60 states have call predecessors, (2775), 60 states have return successors, (2775), 2730 states have call predecessors, (2775), 2775 states have call successors, (2775) [2025-01-09 14:47:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18204 states to 18204 states and 29303 transitions. [2025-01-09 14:47:31,476 INFO L78 Accepts]: Start accepts. Automaton has 18204 states and 29303 transitions. Word has length 521 [2025-01-09 14:47:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:31,477 INFO L471 AbstractCegarLoop]: Abstraction has 18204 states and 29303 transitions. [2025-01-09 14:47:31,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 18204 states and 29303 transitions. [2025-01-09 14:47:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:31,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:31,497 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:31,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash -117495384, now seen corresponding path program 1 times [2025-01-09 14:47:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:31,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025366286] [2025-01-09 14:47:31,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:31,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025366286] [2025-01-09 14:47:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025366286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:32,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:32,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690928036] [2025-01-09 14:47:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:32,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:32,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:32,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:32,562 INFO L87 Difference]: Start difference. First operand 18204 states and 29303 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:33,423 INFO L93 Difference]: Finished difference Result 40485 states and 64741 transitions. [2025-01-09 14:47:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:33,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:33,499 INFO L225 Difference]: With dead ends: 40485 [2025-01-09 14:47:33,499 INFO L226 Difference]: Without dead ends: 22284 [2025-01-09 14:47:33,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:33,535 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 940 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:33,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 2111 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22284 states. [2025-01-09 14:47:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22284 to 10580. [2025-01-09 14:47:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10580 states, 8869 states have (on average 1.526891419551246) internal successors, (13542), 8884 states have internal predecessors, (13542), 1665 states have call successors, (1665), 45 states have call predecessors, (1665), 45 states have return successors, (1665), 1650 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-01-09 14:47:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10580 states to 10580 states and 16872 transitions. [2025-01-09 14:47:34,215 INFO L78 Accepts]: Start accepts. Automaton has 10580 states and 16872 transitions. Word has length 521 [2025-01-09 14:47:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:34,216 INFO L471 AbstractCegarLoop]: Abstraction has 10580 states and 16872 transitions. [2025-01-09 14:47:34,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10580 states and 16872 transitions. [2025-01-09 14:47:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:34,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:34,226 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:47:34,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:34,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1061196066, now seen corresponding path program 1 times [2025-01-09 14:47:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:34,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772513236] [2025-01-09 14:47:34,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:34,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:34,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:34,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772513236] [2025-01-09 14:47:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772513236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593632068] [2025-01-09 14:47:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:35,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:35,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:35,503 INFO L87 Difference]: Start difference. First operand 10580 states and 16872 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:36,443 INFO L93 Difference]: Finished difference Result 22066 states and 35176 transitions. [2025-01-09 14:47:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:36,499 INFO L225 Difference]: With dead ends: 22066 [2025-01-09 14:47:36,499 INFO L226 Difference]: Without dead ends: 14984 [2025-01-09 14:47:36,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:36,519 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 615 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:36,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2069 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:47:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14984 states. [2025-01-09 14:47:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14984 to 13060. [2025-01-09 14:47:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13060 states, 11349 states have (on average 1.5420741915587277) internal successors, (17501), 11364 states have internal predecessors, (17501), 1665 states have call successors, (1665), 45 states have call predecessors, (1665), 45 states have return successors, (1665), 1650 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-01-09 14:47:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 20831 transitions. [2025-01-09 14:47:37,236 INFO L78 Accepts]: Start accepts. Automaton has 13060 states and 20831 transitions. Word has length 521 [2025-01-09 14:47:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:37,237 INFO L471 AbstractCegarLoop]: Abstraction has 13060 states and 20831 transitions. [2025-01-09 14:47:37,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13060 states and 20831 transitions. [2025-01-09 14:47:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:37,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:37,249 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:47:37,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:37,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -624983772, now seen corresponding path program 1 times [2025-01-09 14:47:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728702702] [2025-01-09 14:47:37,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:37,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:37,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:37,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:37,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:38,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728702702] [2025-01-09 14:47:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728702702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:38,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:38,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535063423] [2025-01-09 14:47:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:38,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:38,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:38,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:38,151 INFO L87 Difference]: Start difference. First operand 13060 states and 20831 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:39,462 INFO L93 Difference]: Finished difference Result 44976 states and 71792 transitions. [2025-01-09 14:47:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:39,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-01-09 14:47:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:39,547 INFO L225 Difference]: With dead ends: 44976 [2025-01-09 14:47:39,547 INFO L226 Difference]: Without dead ends: 31919 [2025-01-09 14:47:39,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:39,570 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 707 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:39,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1731 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:47:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31919 states. [2025-01-09 14:47:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31919 to 26855. [2025-01-09 14:47:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26855 states, 23539 states have (on average 1.5422065508305365) internal successors, (36302), 23584 states have internal predecessors, (36302), 3225 states have call successors, (3225), 90 states have call predecessors, (3225), 90 states have return successors, (3225), 3180 states have call predecessors, (3225), 3225 states have call successors, (3225) [2025-01-09 14:47:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26855 states to 26855 states and 42752 transitions. [2025-01-09 14:47:40,400 INFO L78 Accepts]: Start accepts. Automaton has 26855 states and 42752 transitions. Word has length 521 [2025-01-09 14:47:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:40,401 INFO L471 AbstractCegarLoop]: Abstraction has 26855 states and 42752 transitions. [2025-01-09 14:47:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:47:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26855 states and 42752 transitions. [2025-01-09 14:47:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 14:47:40,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:40,424 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:47:40,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:40,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:40,425 INFO L85 PathProgramCache]: Analyzing trace with hash -697370330, now seen corresponding path program 1 times [2025-01-09 14:47:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451570564] [2025-01-09 14:47:40,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:40,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:42,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:42,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 14:47:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451570564] [2025-01-09 14:47:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451570564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786489456] [2025-01-09 14:47:43,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:43,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:43,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:43,294 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:43,296 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:43,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 14:47:43,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 14:47:43,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:43,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:43,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:43,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 3984 proven. 171 refuted. 0 times theorem prover too weak. 6945 trivial. 0 not checked. [2025-01-09 14:47:43,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 51 proven. 171 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 14:47:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786489456] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:44,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:44,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 14:47:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389945725] [2025-01-09 14:47:44,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:44,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:47:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:44,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:47:44,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:47:44,452 INFO L87 Difference]: Start difference. First operand 26855 states and 42752 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-01-09 14:47:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:45,561 INFO L93 Difference]: Finished difference Result 54367 states and 86041 transitions. [2025-01-09 14:47:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:47:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) Word has length 521 [2025-01-09 14:47:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:45,623 INFO L225 Difference]: With dead ends: 54367 [2025-01-09 14:47:45,623 INFO L226 Difference]: Without dead ends: 27515 [2025-01-09 14:47:45,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:47:45,652 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1113 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:45,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 956 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:47:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27515 states. [2025-01-09 14:47:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27515 to 27335. [2025-01-09 14:47:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27335 states, 23899 states have (on average 1.5170927653876731) internal successors, (36257), 23944 states have internal predecessors, (36257), 3225 states have call successors, (3225), 210 states have call predecessors, (3225), 210 states have return successors, (3225), 3180 states have call predecessors, (3225), 3225 states have call successors, (3225) [2025-01-09 14:47:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27335 states to 27335 states and 42707 transitions. [2025-01-09 14:47:46,647 INFO L78 Accepts]: Start accepts. Automaton has 27335 states and 42707 transitions. Word has length 521 [2025-01-09 14:47:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:46,648 INFO L471 AbstractCegarLoop]: Abstraction has 27335 states and 42707 transitions. [2025-01-09 14:47:46,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-01-09 14:47:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27335 states and 42707 transitions. [2025-01-09 14:47:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-01-09 14:47:46,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:46,667 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,676 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:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:46,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1700875244, now seen corresponding path program 1 times [2025-01-09 14:47:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028387127] [2025-01-09 14:47:46,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:46,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-01-09 14:47:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-01-09 14:47:47,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:48,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:48,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028387127] [2025-01-09 14:47:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028387127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:48,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:47:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025935199] [2025-01-09 14:47:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:47:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:48,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:47:48,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:47:48,985 INFO L87 Difference]: Start difference. First operand 27335 states and 42707 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 5 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 5 states have call predecessors, (75), 5 states have call successors, (75) [2025-01-09 14:47:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:53,183 INFO L93 Difference]: Finished difference Result 115925 states and 180691 transitions. [2025-01-09 14:47:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:47:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 5 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 5 states have call predecessors, (75), 5 states have call successors, (75) Word has length 523 [2025-01-09 14:47:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:53,365 INFO L225 Difference]: With dead ends: 115925 [2025-01-09 14:47:53,365 INFO L226 Difference]: Without dead ends: 88593 [2025-01-09 14:47:53,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:47:53,416 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1291 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:53,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2227 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:47:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88593 states. [2025-01-09 14:47:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88593 to 83865. [2025-01-09 14:47:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83865 states, 74774 states have (on average 1.5226950544306845) internal successors, (113858), 74924 states have internal predecessors, (113858), 8490 states have call successors, (8490), 600 states have call predecessors, (8490), 600 states have return successors, (8490), 8340 states have call predecessors, (8490), 8490 states have call successors, (8490) [2025-01-09 14:47:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83865 states to 83865 states and 130838 transitions. [2025-01-09 14:47:58,129 INFO L78 Accepts]: Start accepts. Automaton has 83865 states and 130838 transitions. Word has length 523 [2025-01-09 14:47:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:58,130 INFO L471 AbstractCegarLoop]: Abstraction has 83865 states and 130838 transitions. [2025-01-09 14:47:58,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 5 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 5 states have call predecessors, (75), 5 states have call successors, (75) [2025-01-09 14:47:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 83865 states and 130838 transitions. [2025-01-09 14:47:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-01-09 14:47:58,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:58,174 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:47:58,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:58,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1286949654, now seen corresponding path program 1 times [2025-01-09 14:47:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237341424] [2025-01-09 14:47:58,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:58,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-01-09 14:47:58,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-01-09 14:47:58,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-01-09 14:47:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237341424] [2025-01-09 14:47:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237341424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462889882] [2025-01-09 14:47:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:58,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:58,709 INFO L87 Difference]: Start difference. First operand 83865 states and 130838 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:48:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:04,194 INFO L93 Difference]: Finished difference Result 222456 states and 347178 transitions. [2025-01-09 14:48:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 523 [2025-01-09 14:48:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:04,505 INFO L225 Difference]: With dead ends: 222456 [2025-01-09 14:48:04,506 INFO L226 Difference]: Without dead ends: 138594 [2025-01-09 14:48:04,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:04,652 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 323 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:04,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1149 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:48:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138594 states. [2025-01-09 14:48:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138594 to 138592. [2025-01-09 14:48:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138592 states, 122594 states have (on average 1.5155227825179047) internal successors, (185794), 122835 states have internal predecessors, (185794), 14974 states have call successors, (14974), 1023 states have call predecessors, (14974), 1023 states have return successors, (14974), 14733 states have call predecessors, (14974), 14974 states have call successors, (14974) [2025-01-09 14:48:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138592 states to 138592 states and 215742 transitions. [2025-01-09 14:48:10,693 INFO L78 Accepts]: Start accepts. Automaton has 138592 states and 215742 transitions. Word has length 523 [2025-01-09 14:48:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 138592 states and 215742 transitions. [2025-01-09 14:48:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-01-09 14:48:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 138592 states and 215742 transitions. [2025-01-09 14:48:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-01-09 14:48:10,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:10,733 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:48:10,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:10,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1173153218, now seen corresponding path program 1 times [2025-01-09 14:48:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:10,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237895848] [2025-01-09 14:48:10,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:10,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 14:48:12,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 14:48:12,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:12,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 57 proven. 165 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 14:48:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237895848] [2025-01-09 14:48:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237895848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292458567] [2025-01-09 14:48:12,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:12,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:12,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:12,525 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:48:12,530 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:48:12,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 14:48:12,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 14:48:12,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:12,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:48:12,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 3902 proven. 48 refuted. 0 times theorem prover too weak. 7150 trivial. 0 not checked. [2025-01-09 14:48:13,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:48:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 174 proven. 48 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-01-09 14:48:14,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292458567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:48:14,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:48:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 14:48:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749054506] [2025-01-09 14:48:14,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:48:14,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:48:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:14,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:48:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:48:14,217 INFO L87 Difference]: Start difference. First operand 138592 states and 215742 transitions. Second operand has 14 states, 14 states have (on average 24.642857142857142) internal successors, (345), 14 states have internal predecessors, (345), 5 states have call successors, (205), 3 states have call predecessors, (205), 6 states have return successors, (206), 5 states have call predecessors, (206), 5 states have call successors, (206)