./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.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_fillercode_fillercodesize_ps-cn-250_file-82.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 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:47:50,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:47:50,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:47:50,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:47:50,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:47:50,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:47:50,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:47:50,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:47:50,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:47:50,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:47:50,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:47:50,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:47:50,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:47:50,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:47:50,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:50,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:50,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:47:50,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:47:50,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:47:50,432 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 -> 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 [2025-01-09 09:47:50,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:47:50,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:47:50,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:47:50,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:47:50,665 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:47:50,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-01-09 09:47:51,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95af787d6/94e17593aebf483e83fea954ecfd6ba2/FLAG787d554c1 [2025-01-09 09:47:52,089 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:47:52,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-01-09 09:47:52,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95af787d6/94e17593aebf483e83fea954ecfd6ba2/FLAG787d554c1 [2025-01-09 09:47:52,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95af787d6/94e17593aebf483e83fea954ecfd6ba2 [2025-01-09 09:47:52,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:47:52,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:47:52,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:47:52,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:47:52,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:47:52,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470639bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52, skipping insertion in model container [2025-01-09 09:47:52,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:47:52,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i[916,929] [2025-01-09 09:47:52,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:47:52,665 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:47:52,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i[916,929] [2025-01-09 09:47:52,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:47:52,741 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:47:52,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52 WrapperNode [2025-01-09 09:47:52,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:47:52,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:47:52,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:47:52,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:47:52,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,808 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 573 [2025-01-09 09:47:52,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:47:52,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:47:52,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:47:52,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:47:52,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,839 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 09:47:52,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:47:52,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:47:52,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:47:52,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:47:52,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (1/1) ... [2025-01-09 09:47:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:52,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:47:52,918 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 09:47:52,920 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 09:47:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:47:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:47:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:47:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:47:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:47:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:47:53,037 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:47:53,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:47:53,628 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 09:47:53,629 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:47:53,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:47:53,637 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:47:53,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:47:53 BoogieIcfgContainer [2025-01-09 09:47:53,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:47:53,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:47:53,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:47:53,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:47:53,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:47:52" (1/3) ... [2025-01-09 09:47:53,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:47:53, skipping insertion in model container [2025-01-09 09:47:53,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:47:52" (2/3) ... [2025-01-09 09:47:53,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:47:53, skipping insertion in model container [2025-01-09 09:47:53,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:47:53" (3/3) ... [2025-01-09 09:47:53,646 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-01-09 09:47:53,656 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:47:53,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:47:53,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:47:53,711 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;@3adca02f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:47:53,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:47:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 152 states have (on average 1.513157894736842) internal successors, (230), 153 states have internal predecessors, (230), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 09:47:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 09:47:53,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:47:53,742 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:53,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:47:53,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:47:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 858405924, now seen corresponding path program 1 times [2025-01-09 09:47:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:47:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98018702] [2025-01-09 09:47:53,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:47:53,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:47:53,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:47:53,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:53,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 09:47:54,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:47:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98018702] [2025-01-09 09:47:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98018702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:47:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014700800] [2025-01-09 09:47:54,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:47:54,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:47:54,233 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 09:47:54,235 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 09:47:54,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:47:54,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:47:54,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:54,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:54,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:47:54,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:47:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 09:47:54,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:47:54,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014700800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:47:54,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:47:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:47:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734105380] [2025-01-09 09:47:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:47:54,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:47:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:54,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:47:54,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:47:54,589 INFO L87 Difference]: Start difference. First operand has 235 states, 152 states have (on average 1.513157894736842) internal successors, (230), 153 states have internal predecessors, (230), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 09:47:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:47:54,640 INFO L93 Difference]: Finished difference Result 463 states and 853 transitions. [2025-01-09 09:47:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:47:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 502 [2025-01-09 09:47:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:47:54,653 INFO L225 Difference]: With dead ends: 463 [2025-01-09 09:47:54,653 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 09:47:54,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 503 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 09:47:54,660 INFO L435 NwaCegarLoop]: 382 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, 382 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 09:47:54,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:47:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 09:47:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-01-09 09:47:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 149 states have internal predecessors, (222), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 09:47:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 382 transitions. [2025-01-09 09:47:54,723 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 382 transitions. Word has length 502 [2025-01-09 09:47:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:47:54,724 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 382 transitions. [2025-01-09 09:47:54,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 09:47:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 382 transitions. [2025-01-09 09:47:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 09:47:54,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:47:54,739 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:54,747 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 09:47:54,939 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 09:47:54,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:47:54,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:47:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash 412094832, now seen corresponding path program 1 times [2025-01-09 09:47:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:47:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384572980] [2025-01-09 09:47:54,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:47:54,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:47:55,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:47:55,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:55,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:47:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:47:55,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384572980] [2025-01-09 09:47:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384572980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:47:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:47:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:47:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131847327] [2025-01-09 09:47:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:47:55,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:47:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:55,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:47:55,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:47:55,382 INFO L87 Difference]: Start difference. First operand 231 states and 382 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:47:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:47:55,470 INFO L93 Difference]: Finished difference Result 594 states and 985 transitions. [2025-01-09 09:47:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:47:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 502 [2025-01-09 09:47:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:47:55,475 INFO L225 Difference]: With dead ends: 594 [2025-01-09 09:47:55,475 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 09:47:55,476 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 09:47:55,477 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 222 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:47:55,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 727 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:47:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 09:47:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2025-01-09 09:47:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 250 states have internal predecessors, (376), 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 09:47:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 598 transitions. [2025-01-09 09:47:55,526 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 598 transitions. Word has length 502 [2025-01-09 09:47:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:47:55,528 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 598 transitions. [2025-01-09 09:47:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:47:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 598 transitions. [2025-01-09 09:47:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 09:47:55,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:47:55,538 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:47:55,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:47:55,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:47:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1476938765, now seen corresponding path program 1 times [2025-01-09 09:47:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:47:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987245472] [2025-01-09 09:47:55,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:47:55,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 09:47:55,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 09:47:55,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:55,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:47:56,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:47:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987245472] [2025-01-09 09:47:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987245472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:47:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:47:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:47:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966352619] [2025-01-09 09:47:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:47:56,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:47:56,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:56,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:47:56,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:47:56,510 INFO L87 Difference]: Start difference. First operand 363 states and 598 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:47:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:47:56,712 INFO L93 Difference]: Finished difference Result 981 states and 1618 transitions. [2025-01-09 09:47:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:47:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-01-09 09:47:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:47:56,719 INFO L225 Difference]: With dead ends: 981 [2025-01-09 09:47:56,719 INFO L226 Difference]: Without dead ends: 621 [2025-01-09 09:47:56,720 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 09:47:56,721 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 209 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:47:56,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1017 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:47:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-01-09 09:47:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 611. [2025-01-09 09:47:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 437 states have (on average 1.528604118993135) internal successors, (668), 440 states have internal predecessors, (668), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 09:47:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1006 transitions. [2025-01-09 09:47:56,761 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1006 transitions. Word has length 503 [2025-01-09 09:47:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:47:56,762 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1006 transitions. [2025-01-09 09:47:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:47:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1006 transitions. [2025-01-09 09:47:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:47:56,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:47:56,765 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:56,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:47:56,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:47:56,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:47:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash 388599117, now seen corresponding path program 1 times [2025-01-09 09:47:56,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:47:56,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806727242] [2025-01-09 09:47:56,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:47:56,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:47:56,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:47:57,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:47:57,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:47:57,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:47:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:47:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:47:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806727242] [2025-01-09 09:47:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806727242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:47:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:47:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:47:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628349452] [2025-01-09 09:47:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:47:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:47:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:47:58,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:47:58,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:47:58,899 INFO L87 Difference]: Start difference. First operand 611 states and 1006 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:01,426 INFO L93 Difference]: Finished difference Result 1876 states and 3032 transitions. [2025-01-09 09:48:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:48:01,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 504 [2025-01-09 09:48:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:01,434 INFO L225 Difference]: With dead ends: 1876 [2025-01-09 09:48:01,434 INFO L226 Difference]: Without dead ends: 1268 [2025-01-09 09:48:01,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:48:01,441 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 2158 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 979 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 979 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:01,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2713 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [979 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 09:48:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-01-09 09:48:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 859. [2025-01-09 09:48:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 628 states have (on average 1.517515923566879) internal successors, (953), 633 states have internal predecessors, (953), 223 states have call successors, (223), 7 states have call predecessors, (223), 7 states have return successors, (223), 218 states have call predecessors, (223), 223 states have call successors, (223) [2025-01-09 09:48:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1399 transitions. [2025-01-09 09:48:01,516 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1399 transitions. Word has length 504 [2025-01-09 09:48:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:01,517 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1399 transitions. [2025-01-09 09:48:01,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1399 transitions. [2025-01-09 09:48:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:48:01,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:01,521 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:01,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:01,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:01,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1416839217, now seen corresponding path program 1 times [2025-01-09 09:48:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706222807] [2025-01-09 09:48:01,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:01,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:48:01,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:48:01,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:01,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:48:03,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:03,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706222807] [2025-01-09 09:48:03,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706222807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:03,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:03,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:48:03,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393202357] [2025-01-09 09:48:03,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:03,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:03,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:03,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:03,133 INFO L87 Difference]: Start difference. First operand 859 states and 1399 transitions. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 09:48:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:05,391 INFO L93 Difference]: Finished difference Result 2849 states and 4588 transitions. [2025-01-09 09:48:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:48:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 504 [2025-01-09 09:48:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:05,403 INFO L225 Difference]: With dead ends: 2849 [2025-01-09 09:48:05,403 INFO L226 Difference]: Without dead ends: 1993 [2025-01-09 09:48:05,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:48:05,408 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 1823 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:05,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 2112 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 09:48:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-01-09 09:48:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 930. [2025-01-09 09:48:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 699 states have (on average 1.530758226037196) internal successors, (1070), 704 states have internal predecessors, (1070), 223 states have call successors, (223), 7 states have call predecessors, (223), 7 states have return successors, (223), 218 states have call predecessors, (223), 223 states have call successors, (223) [2025-01-09 09:48:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1516 transitions. [2025-01-09 09:48:05,504 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1516 transitions. Word has length 504 [2025-01-09 09:48:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:05,506 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1516 transitions. [2025-01-09 09:48:05,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 09:48:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1516 transitions. [2025-01-09 09:48:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:48:05,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:05,510 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:05,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:48:05,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:05,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1232604619, now seen corresponding path program 1 times [2025-01-09 09:48:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957169065] [2025-01-09 09:48:05,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:05,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:48:05,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:48:05,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:05,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:48:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957169065] [2025-01-09 09:48:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957169065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:06,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:06,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:48:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251210877] [2025-01-09 09:48:06,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:06,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:48:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:06,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:48:06,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:06,669 INFO L87 Difference]: Start difference. First operand 930 states and 1516 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:07,849 INFO L93 Difference]: Finished difference Result 2319 states and 3761 transitions. [2025-01-09 09:48:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:48:07,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 504 [2025-01-09 09:48:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:07,859 INFO L225 Difference]: With dead ends: 2319 [2025-01-09 09:48:07,859 INFO L226 Difference]: Without dead ends: 1392 [2025-01-09 09:48:07,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:48:07,864 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1013 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:07,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1769 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:48:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-01-09 09:48:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 956. [2025-01-09 09:48:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 725 states have (on average 1.533793103448276) internal successors, (1112), 730 states have internal predecessors, (1112), 223 states have call successors, (223), 7 states have call predecessors, (223), 7 states have return successors, (223), 218 states have call predecessors, (223), 223 states have call successors, (223) [2025-01-09 09:48:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1558 transitions. [2025-01-09 09:48:07,948 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1558 transitions. Word has length 504 [2025-01-09 09:48:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:07,951 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1558 transitions. [2025-01-09 09:48:07,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1558 transitions. [2025-01-09 09:48:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:48:07,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:07,955 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:07,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash -572833715, now seen corresponding path program 1 times [2025-01-09 09:48:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314075684] [2025-01-09 09:48:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:07,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:48:08,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:48:08,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:08,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 177 proven. 60 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:48:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314075684] [2025-01-09 09:48:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314075684] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928308241] [2025-01-09 09:48:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:08,394 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 09:48:08,396 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 09:48:08,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:48:08,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:48:08,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:08,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:08,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:48:08,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 849 proven. 6 refuted. 0 times theorem prover too weak. 11785 trivial. 0 not checked. [2025-01-09 09:48:08,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 231 proven. 6 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:48:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928308241] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:48:09,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:48:09,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 09:48:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031074649] [2025-01-09 09:48:09,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:09,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:48:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:09,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:48:09,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:48:09,026 INFO L87 Difference]: Start difference. First operand 956 states and 1558 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-01-09 09:48:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:09,630 INFO L93 Difference]: Finished difference Result 1925 states and 3127 transitions. [2025-01-09 09:48:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:48:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 504 [2025-01-09 09:48:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:09,643 INFO L225 Difference]: With dead ends: 1925 [2025-01-09 09:48:09,643 INFO L226 Difference]: Without dead ends: 972 [2025-01-09 09:48:09,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:48:09,651 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 368 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:09,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 711 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:48:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-01-09 09:48:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 956. [2025-01-09 09:48:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 723 states have (on average 1.5131396957123098) internal successors, (1094), 728 states have internal predecessors, (1094), 223 states have call successors, (223), 9 states have call predecessors, (223), 9 states have return successors, (223), 218 states have call predecessors, (223), 223 states have call successors, (223) [2025-01-09 09:48:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1540 transitions. [2025-01-09 09:48:09,750 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1540 transitions. Word has length 504 [2025-01-09 09:48:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:09,750 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1540 transitions. [2025-01-09 09:48:09,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-01-09 09:48:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1540 transitions. [2025-01-09 09:48:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 09:48:09,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:09,755 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:09,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:48:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:09,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1926223818, now seen corresponding path program 1 times [2025-01-09 09:48:09,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175048234] [2025-01-09 09:48:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:09,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 09:48:10,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 09:48:10,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:48:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175048234] [2025-01-09 09:48:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175048234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339204278] [2025-01-09 09:48:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:10,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:10,254 INFO L87 Difference]: Start difference. First operand 956 states and 1540 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:10,496 INFO L93 Difference]: Finished difference Result 1915 states and 3083 transitions. [2025-01-09 09:48:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:10,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 505 [2025-01-09 09:48:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:10,504 INFO L225 Difference]: With dead ends: 1915 [2025-01-09 09:48:10,504 INFO L226 Difference]: Without dead ends: 962 [2025-01-09 09:48:10,506 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 09:48:10,506 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 592 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:10,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 378 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:48:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-01-09 09:48:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 956. [2025-01-09 09:48:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 723 states have (on average 1.5048409405255878) internal successors, (1088), 728 states have internal predecessors, (1088), 223 states have call successors, (223), 9 states have call predecessors, (223), 9 states have return successors, (223), 218 states have call predecessors, (223), 223 states have call successors, (223) [2025-01-09 09:48:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1534 transitions. [2025-01-09 09:48:10,612 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1534 transitions. Word has length 505 [2025-01-09 09:48:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:10,612 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1534 transitions. [2025-01-09 09:48:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1534 transitions. [2025-01-09 09:48:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 09:48:10,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:10,618 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:10,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:48:10,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:10,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash 646360140, now seen corresponding path program 1 times [2025-01-09 09:48:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:10,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320158846] [2025-01-09 09:48:10,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:10,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 09:48:10,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 09:48:10,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:48:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320158846] [2025-01-09 09:48:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320158846] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119001768] [2025-01-09 09:48:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:10,965 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 09:48:10,967 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 09:48:11,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 09:48:11,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 09:48:11,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:11,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:11,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:48:11,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 5937 proven. 150 refuted. 0 times theorem prover too weak. 6553 trivial. 0 not checked. [2025-01-09 09:48:11,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:48:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119001768] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:48:12,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:48:12,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 09:48:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697697823] [2025-01-09 09:48:12,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:12,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:12,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:12,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:12,012 INFO L87 Difference]: Start difference. First operand 956 states and 1534 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-01-09 09:48:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:12,396 INFO L93 Difference]: Finished difference Result 1679 states and 2665 transitions. [2025-01-09 09:48:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:48:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) Word has length 505 [2025-01-09 09:48:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:12,402 INFO L225 Difference]: With dead ends: 1679 [2025-01-09 09:48:12,402 INFO L226 Difference]: Without dead ends: 726 [2025-01-09 09:48:12,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:48:12,407 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 318 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:12,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 651 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:48:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-01-09 09:48:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 712. [2025-01-09 09:48:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 535 states have (on average 1.4504672897196262) internal successors, (776), 538 states have internal predecessors, (776), 165 states have call successors, (165), 11 states have call predecessors, (165), 11 states have return successors, (165), 162 states have call predecessors, (165), 165 states have call successors, (165) [2025-01-09 09:48:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1106 transitions. [2025-01-09 09:48:12,475 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1106 transitions. Word has length 505 [2025-01-09 09:48:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:12,475 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1106 transitions. [2025-01-09 09:48:12,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-01-09 09:48:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1106 transitions. [2025-01-09 09:48:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 09:48:12,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:12,479 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:12,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:48:12,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:12,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:12,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash -906760461, now seen corresponding path program 1 times [2025-01-09 09:48:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:12,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338415548] [2025-01-09 09:48:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:12,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 09:48:12,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 09:48:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 477 proven. 216 refuted. 0 times theorem prover too weak. 11947 trivial. 0 not checked. [2025-01-09 09:48:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338415548] [2025-01-09 09:48:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338415548] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760932011] [2025-01-09 09:48:14,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:14,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:14,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:14,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:48:14,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:48:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 09:48:14,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 09:48:14,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:14,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:14,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 09:48:14,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6709 proven. 216 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2025-01-09 09:48:21,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 477 proven. 225 refuted. 0 times theorem prover too weak. 11938 trivial. 0 not checked. [2025-01-09 09:48:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760932011] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:48:22,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:48:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 37 [2025-01-09 09:48:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674640482] [2025-01-09 09:48:22,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:22,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 09:48:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:22,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 09:48:22,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 09:48:22,647 INFO L87 Difference]: Start difference. First operand 712 states and 1106 transitions. Second operand has 37 states, 36 states have (on average 5.972222222222222) internal successors, (215), 35 states have internal predecessors, (215), 7 states have call successors, (138), 4 states have call predecessors, (138), 9 states have return successors, (139), 7 states have call predecessors, (139), 7 states have call successors, (139) [2025-01-09 09:48:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:54,553 INFO L93 Difference]: Finished difference Result 4342 states and 6557 transitions. [2025-01-09 09:48:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-09 09:48:54,554 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.972222222222222) internal successors, (215), 35 states have internal predecessors, (215), 7 states have call successors, (138), 4 states have call predecessors, (138), 9 states have return successors, (139), 7 states have call predecessors, (139), 7 states have call successors, (139) Word has length 506 [2025-01-09 09:48:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:54,579 INFO L225 Difference]: With dead ends: 4342 [2025-01-09 09:48:54,580 INFO L226 Difference]: Without dead ends: 3633 [2025-01-09 09:48:54,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2929, Invalid=7991, Unknown=0, NotChecked=0, Total=10920 [2025-01-09 09:48:54,584 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 3231 mSDsluCounter, 4388 mSDsCounter, 0 mSdLazyCounter, 4803 mSolverCounterSat, 2454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3281 SdHoareTripleChecker+Valid, 4934 SdHoareTripleChecker+Invalid, 7257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2454 IncrementalHoareTripleChecker+Valid, 4803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:54,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3281 Valid, 4934 Invalid, 7257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2454 Valid, 4803 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2025-01-09 09:48:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2025-01-09 09:48:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 1517. [2025-01-09 09:48:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1108 states have (on average 1.4250902527075813) internal successors, (1579), 1118 states have internal predecessors, (1579), 378 states have call successors, (378), 30 states have call predecessors, (378), 30 states have return successors, (378), 368 states have call predecessors, (378), 378 states have call successors, (378) [2025-01-09 09:48:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2335 transitions. [2025-01-09 09:48:54,918 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2335 transitions. Word has length 506 [2025-01-09 09:48:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:54,918 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2335 transitions. [2025-01-09 09:48:54,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.972222222222222) internal successors, (215), 35 states have internal predecessors, (215), 7 states have call successors, (138), 4 states have call predecessors, (138), 9 states have return successors, (139), 7 states have call predecessors, (139), 7 states have call successors, (139) [2025-01-09 09:48:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2335 transitions. [2025-01-09 09:48:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 09:48:54,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:54,922 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:54,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 09:48:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 09:48:55,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:55,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash -231710221, now seen corresponding path program 1 times [2025-01-09 09:48:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053995652] [2025-01-09 09:48:55,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:55,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 09:48:55,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 09:48:55,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:55,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:48:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053995652] [2025-01-09 09:48:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053995652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:56,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:56,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:48:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016646550] [2025-01-09 09:48:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:56,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:56,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:56,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:56,685 INFO L87 Difference]: Start difference. First operand 1517 states and 2335 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:48:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:59,634 INFO L93 Difference]: Finished difference Result 5192 states and 7937 transitions. [2025-01-09 09:48:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:48:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 506 [2025-01-09 09:48:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:59,652 INFO L225 Difference]: With dead ends: 5192 [2025-01-09 09:48:59,652 INFO L226 Difference]: Without dead ends: 3678 [2025-01-09 09:48:59,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:48:59,657 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 1168 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:59,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 2541 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:48:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2025-01-09 09:49:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 2237. [2025-01-09 09:49:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1578 states have (on average 1.394169835234474) internal successors, (2200), 1595 states have internal predecessors, (2200), 605 states have call successors, (605), 53 states have call predecessors, (605), 53 states have return successors, (605), 588 states have call predecessors, (605), 605 states have call successors, (605) [2025-01-09 09:49:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3410 transitions. [2025-01-09 09:49:00,313 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3410 transitions. Word has length 506 [2025-01-09 09:49:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:00,314 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 3410 transitions. [2025-01-09 09:49:00,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:49:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3410 transitions. [2025-01-09 09:49:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 09:49:00,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:00,320 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:00,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:49:00,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -891241743, now seen corresponding path program 1 times [2025-01-09 09:49:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337463160] [2025-01-09 09:49:00,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:00,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 09:49:00,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 09:49:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 153 proven. 84 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:49:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337463160] [2025-01-09 09:49:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337463160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294040242] [2025-01-09 09:49:03,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:03,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:49:03,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 09:49:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 09:49:03,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 09:49:03,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:03,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:03,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 09:49:03,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 9149 proven. 720 refuted. 0 times theorem prover too weak. 2771 trivial. 0 not checked. [2025-01-09 09:49:07,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 480 proven. 450 refuted. 0 times theorem prover too weak. 11710 trivial. 0 not checked. [2025-01-09 09:49:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294040242] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:49:09,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:49:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 20] total 57 [2025-01-09 09:49:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182370323] [2025-01-09 09:49:09,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:49:09,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-01-09 09:49:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:09,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-01-09 09:49:09,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=2639, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 09:49:09,659 INFO L87 Difference]: Start difference. First operand 2237 states and 3410 transitions. Second operand has 57 states, 54 states have (on average 5.166666666666667) internal successors, (279), 52 states have internal predecessors, (279), 17 states have call successors, (180), 8 states have call predecessors, (180), 16 states have return successors, (182), 17 states have call predecessors, (182), 17 states have call successors, (182)