./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.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_loopvsstraightlinecode_100-while_file-88.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 0f173a1e127c6e1033e5b4dd17ed93bd9e595663c9235b403a3de8ffd3ad4687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:12:30,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:12:30,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:12:30,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:12:30,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:12:31,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:12:31,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:12:31,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:12:31,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:12:31,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:12:31,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:12:31,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:12:31,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:12:31,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:12:31,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:12:31,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:12:31,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:12:31,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:12:31,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:12:31,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:12:31,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:12:31,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:12:31,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:12:31,008 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 -> 0f173a1e127c6e1033e5b4dd17ed93bd9e595663c9235b403a3de8ffd3ad4687 [2025-01-09 13:12:31,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:12:31,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:12:31,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:12:31,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:12:31,248 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:12:31,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.i [2025-01-09 13:12:32,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9d6c69f0/6bb517f059e3440ba580b9a24608350a/FLAG1309be653 [2025-01-09 13:12:32,703 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:12:32,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.i [2025-01-09 13:12:32,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9d6c69f0/6bb517f059e3440ba580b9a24608350a/FLAG1309be653 [2025-01-09 13:12:33,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9d6c69f0/6bb517f059e3440ba580b9a24608350a [2025-01-09 13:12:33,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:12:33,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:12:33,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:12:33,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:12:33,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:12:33,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33, skipping insertion in model container [2025-01-09 13:12:33,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:12:33,139 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_loopvsstraightlinecode_100-while_file-88.i[916,929] [2025-01-09 13:12:33,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:12:33,235 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:12:33,242 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_loopvsstraightlinecode_100-while_file-88.i[916,929] [2025-01-09 13:12:33,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:12:33,287 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:12:33,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33 WrapperNode [2025-01-09 13:12:33,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:12:33,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:12:33,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:12:33,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:12:33,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,330 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 278 [2025-01-09 13:12:33,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:12:33,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:12:33,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:12:33,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:12:33,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,355 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 13:12:33,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:12:33,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:12:33,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:12:33,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:12:33,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (1/1) ... [2025-01-09 13:12:33,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:12:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:33,401 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 13:12:33,403 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 13:12:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:12:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:12:33,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:12:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:12:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:12:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:12:33,503 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:12:33,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:12:33,895 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-01-09 13:12:33,895 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:12:33,902 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:12:33,902 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:12:33,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:12:33 BoogieIcfgContainer [2025-01-09 13:12:33,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:12:33,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:12:33,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:12:33,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:12:33,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:12:33" (1/3) ... [2025-01-09 13:12:33,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a1854c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:12:33, skipping insertion in model container [2025-01-09 13:12:33,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:33" (2/3) ... [2025-01-09 13:12:33,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a1854c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:12:33, skipping insertion in model container [2025-01-09 13:12:33,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:12:33" (3/3) ... [2025-01-09 13:12:33,910 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-88.i [2025-01-09 13:12:33,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:12:33,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-88.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:12:33,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:12:33,980 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;@44532a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:12:33,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:12:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:12:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 13:12:33,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:33,997 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:33,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:34,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 491713491, now seen corresponding path program 1 times [2025-01-09 13:12:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298925310] [2025-01-09 13:12:34,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 13:12:34,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 13:12:34,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:34,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 13:12:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298925310] [2025-01-09 13:12:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298925310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:12:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823962945] [2025-01-09 13:12:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:34,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:34,286 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 13:12:34,287 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 13:12:34,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 13:12:34,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 13:12:34,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:34,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:34,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:12:34,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:12:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 13:12:34,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:12:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823962945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:12:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:12:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758116347] [2025-01-09 13:12:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:34,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:12:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:34,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:12:34,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:12:34,550 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:12:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:34,573 INFO L93 Difference]: Finished difference Result 226 states and 377 transitions. [2025-01-09 13:12:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:12:34,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2025-01-09 13:12:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:34,583 INFO L225 Difference]: With dead ends: 226 [2025-01-09 13:12:34,583 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 13:12:34,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 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 13:12:34,587 INFO L435 NwaCegarLoop]: 172 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, 172 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 13:12:34,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:12:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 13:12:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 13:12:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:12:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2025-01-09 13:12:34,634 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 191 [2025-01-09 13:12:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:34,635 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2025-01-09 13:12:34,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:12:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2025-01-09 13:12:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 13:12:34,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:34,640 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:34,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:12:34,840 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 13:12:34,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:34,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2101291701, now seen corresponding path program 1 times [2025-01-09 13:12:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796194984] [2025-01-09 13:12:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:34,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 13:12:34,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 13:12:34,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:34,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:35,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796194984] [2025-01-09 13:12:35,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796194984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:12:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904310443] [2025-01-09 13:12:35,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:35,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:12:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:35,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:12:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:12:35,401 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:35,574 INFO L93 Difference]: Finished difference Result 373 states and 567 transitions. [2025-01-09 13:12:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:12:35,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2025-01-09 13:12:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:35,577 INFO L225 Difference]: With dead ends: 373 [2025-01-09 13:12:35,577 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 13:12:35,578 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 13:12:35,578 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 250 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:35,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 484 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:12:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 13:12:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 217. [2025-01-09 13:12:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 13:12:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2025-01-09 13:12:35,615 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 191 [2025-01-09 13:12:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:35,616 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2025-01-09 13:12:35,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2025-01-09 13:12:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 13:12:35,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:35,621 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:35,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:12:35,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1086787349, now seen corresponding path program 1 times [2025-01-09 13:12:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659978825] [2025-01-09 13:12:35,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:35,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 13:12:35,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 13:12:35,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:35,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659978825] [2025-01-09 13:12:36,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659978825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:36,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:36,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:12:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249660693] [2025-01-09 13:12:36,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:36,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:12:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:36,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:12:36,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:12:36,025 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:36,448 INFO L93 Difference]: Finished difference Result 580 states and 878 transitions. [2025-01-09 13:12:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:12:36,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-01-09 13:12:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:36,451 INFO L225 Difference]: With dead ends: 580 [2025-01-09 13:12:36,451 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 13:12:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:12:36,453 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 107 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:36,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 544 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:12:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 13:12:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 282. [2025-01-09 13:12:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 194 states have (on average 1.3402061855670102) internal successors, (260), 194 states have internal predecessors, (260), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 13:12:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 428 transitions. [2025-01-09 13:12:36,489 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 428 transitions. Word has length 192 [2025-01-09 13:12:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:36,490 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 428 transitions. [2025-01-09 13:12:36,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 428 transitions. [2025-01-09 13:12:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 13:12:36,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:36,492 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:36,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:12:36,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:36,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash -664085523, now seen corresponding path program 1 times [2025-01-09 13:12:36,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:36,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138230840] [2025-01-09 13:12:36,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:36,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 13:12:36,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 13:12:36,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:36,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:37,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138230840] [2025-01-09 13:12:37,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138230840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:12:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008075246] [2025-01-09 13:12:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:12:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:12:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:12:37,154 INFO L87 Difference]: Start difference. First operand 282 states and 428 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:37,999 INFO L93 Difference]: Finished difference Result 953 states and 1447 transitions. [2025-01-09 13:12:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:12:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-01-09 13:12:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:38,006 INFO L225 Difference]: With dead ends: 953 [2025-01-09 13:12:38,006 INFO L226 Difference]: Without dead ends: 739 [2025-01-09 13:12:38,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:12:38,007 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 412 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:38,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 804 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:12:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-01-09 13:12:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 406. [2025-01-09 13:12:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 289 states have (on average 1.3667820069204153) internal successors, (395), 289 states have internal predecessors, (395), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 13:12:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 619 transitions. [2025-01-09 13:12:38,090 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 619 transitions. Word has length 192 [2025-01-09 13:12:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:38,091 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 619 transitions. [2025-01-09 13:12:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 619 transitions. [2025-01-09 13:12:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 13:12:38,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:38,093 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:38,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:12:38,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1943949201, now seen corresponding path program 1 times [2025-01-09 13:12:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893266396] [2025-01-09 13:12:38,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:38,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 13:12:38,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 13:12:38,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:38,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893266396] [2025-01-09 13:12:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893266396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:12:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415215210] [2025-01-09 13:12:38,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:12:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:38,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:12:38,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:12:38,425 INFO L87 Difference]: Start difference. First operand 406 states and 619 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:39,146 INFO L93 Difference]: Finished difference Result 1296 states and 1978 transitions. [2025-01-09 13:12:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:12:39,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-01-09 13:12:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:39,151 INFO L225 Difference]: With dead ends: 1296 [2025-01-09 13:12:39,154 INFO L226 Difference]: Without dead ends: 958 [2025-01-09 13:12:39,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:12:39,155 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 601 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:39,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 729 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:12:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-01-09 13:12:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 532. [2025-01-09 13:12:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 386 states have (on average 1.3860103626943006) internal successors, (535), 386 states have internal predecessors, (535), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 13:12:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2025-01-09 13:12:39,226 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 192 [2025-01-09 13:12:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:39,227 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2025-01-09 13:12:39,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2025-01-09 13:12:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 13:12:39,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:39,230 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:39,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:12:39,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash -969888917, now seen corresponding path program 1 times [2025-01-09 13:12:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532630526] [2025-01-09 13:12:39,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:39,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 13:12:39,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 13:12:39,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:39,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:39,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532630526] [2025-01-09 13:12:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532630526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:39,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:12:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908728624] [2025-01-09 13:12:39,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:39,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:12:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:39,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:12:39,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:12:39,433 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:39,709 INFO L93 Difference]: Finished difference Result 1442 states and 2211 transitions. [2025-01-09 13:12:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:12:39,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-01-09 13:12:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:39,715 INFO L225 Difference]: With dead ends: 1442 [2025-01-09 13:12:39,715 INFO L226 Difference]: Without dead ends: 978 [2025-01-09 13:12:39,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:12:39,717 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 166 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:39,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 453 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:12:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-01-09 13:12:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2025-01-09 13:12:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.376750700280112) internal successors, (983), 714 states have internal predecessors, (983), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:12:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1487 transitions. [2025-01-09 13:12:39,860 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1487 transitions. Word has length 193 [2025-01-09 13:12:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1487 transitions. [2025-01-09 13:12:39,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1487 transitions. [2025-01-09 13:12:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 13:12:39,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:39,862 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:39,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:12:39,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1218124924, now seen corresponding path program 1 times [2025-01-09 13:12:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:39,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215784127] [2025-01-09 13:12:39,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:39,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 13:12:39,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 13:12:39,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:39,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:39,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215784127] [2025-01-09 13:12:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215784127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:12:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115094522] [2025-01-09 13:12:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:39,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:12:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:39,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:12:39,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:12:39,954 INFO L87 Difference]: Start difference. First operand 976 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:40,092 INFO L93 Difference]: Finished difference Result 1962 states and 2994 transitions. [2025-01-09 13:12:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:12:40,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-01-09 13:12:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:40,098 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 13:12:40,098 INFO L226 Difference]: Without dead ends: 1056 [2025-01-09 13:12:40,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:12:40,101 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:40,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:12:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-01-09 13:12:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 976. [2025-01-09 13:12:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.3711484593837535) internal successors, (979), 714 states have internal predecessors, (979), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:12:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1483 transitions. [2025-01-09 13:12:40,202 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1483 transitions. Word has length 194 [2025-01-09 13:12:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:40,202 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1483 transitions. [2025-01-09 13:12:40,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1483 transitions. [2025-01-09 13:12:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:12:40,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:40,204 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:40,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:12:40,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:40,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1497963776, now seen corresponding path program 1 times [2025-01-09 13:12:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442018259] [2025-01-09 13:12:40,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:12:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:12:40,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:40,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:12:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442018259] [2025-01-09 13:12:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442018259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:12:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61339508] [2025-01-09 13:12:40,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:40,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:40,628 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 13:12:40,633 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 13:12:40,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:12:40,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:12:40,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:40,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:40,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:12:40,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:12:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:40,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:12:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61339508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:12:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-09 13:12:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481543476] [2025-01-09 13:12:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:40,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:12:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:40,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:12:40,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:12:40,853 INFO L87 Difference]: Start difference. First operand 976 states and 1483 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:41,317 INFO L93 Difference]: Finished difference Result 2604 states and 3962 transitions. [2025-01-09 13:12:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:12:41,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-01-09 13:12:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:41,327 INFO L225 Difference]: With dead ends: 2604 [2025-01-09 13:12:41,328 INFO L226 Difference]: Without dead ends: 1694 [2025-01-09 13:12:41,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:12:41,331 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 272 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:41,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 955 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:12:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-01-09 13:12:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1422. [2025-01-09 13:12:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1044 states have (on average 1.353448275862069) internal successors, (1413), 1044 states have internal predecessors, (1413), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 13:12:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2141 transitions. [2025-01-09 13:12:41,577 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2141 transitions. Word has length 195 [2025-01-09 13:12:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:41,578 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2141 transitions. [2025-01-09 13:12:41,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2141 transitions. [2025-01-09 13:12:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:12:41,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:41,582 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:41,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:12:41,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:41,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:41,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash -946903181, now seen corresponding path program 1 times [2025-01-09 13:12:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821160049] [2025-01-09 13:12:41,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:41,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:12:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:12:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:41,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821160049] [2025-01-09 13:12:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821160049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:12:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695576726] [2025-01-09 13:12:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:12:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:42,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:12:42,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:12:42,353 INFO L87 Difference]: Start difference. First operand 1422 states and 2141 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:43,145 INFO L93 Difference]: Finished difference Result 3130 states and 4713 transitions. [2025-01-09 13:12:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:12:43,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-01-09 13:12:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:43,154 INFO L225 Difference]: With dead ends: 3130 [2025-01-09 13:12:43,154 INFO L226 Difference]: Without dead ends: 1778 [2025-01-09 13:12:43,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:12:43,157 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 307 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:43,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1165 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:12:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-01-09 13:12:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1474. [2025-01-09 13:12:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1096 states have (on average 1.35492700729927) internal successors, (1485), 1096 states have internal predecessors, (1485), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 13:12:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2213 transitions. [2025-01-09 13:12:43,296 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2213 transitions. Word has length 195 [2025-01-09 13:12:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:43,297 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2213 transitions. [2025-01-09 13:12:43,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2213 transitions. [2025-01-09 13:12:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:12:43,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:43,299 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:12:43,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1685165303, now seen corresponding path program 1 times [2025-01-09 13:12:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333606284] [2025-01-09 13:12:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:43,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:43,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:43,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:12:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:43,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333606284] [2025-01-09 13:12:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333606284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:12:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31115644] [2025-01-09 13:12:43,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:43,647 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 13:12:43,648 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 13:12:43,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:43,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:43,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:43,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:12:43,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:12:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-01-09 13:12:43,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:12:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:12:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31115644] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:12:44,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:12:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 13:12:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266321132] [2025-01-09 13:12:44,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:12:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:12:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:44,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:12:44,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:12:44,090 INFO L87 Difference]: Start difference. First operand 1474 states and 2213 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 13:12:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:44,898 INFO L93 Difference]: Finished difference Result 3803 states and 5602 transitions. [2025-01-09 13:12:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 13:12:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2025-01-09 13:12:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:44,913 INFO L225 Difference]: With dead ends: 3803 [2025-01-09 13:12:44,913 INFO L226 Difference]: Without dead ends: 2399 [2025-01-09 13:12:44,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-01-09 13:12:44,917 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 489 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:44,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 751 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:12:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2025-01-09 13:12:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1526. [2025-01-09 13:12:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1135 states have (on average 1.3427312775330396) internal successors, (1524), 1135 states have internal predecessors, (1524), 364 states have call successors, (364), 26 states have call predecessors, (364), 26 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 13:12:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2252 transitions. [2025-01-09 13:12:45,066 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2252 transitions. Word has length 196 [2025-01-09 13:12:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:45,067 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2252 transitions. [2025-01-09 13:12:45,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 13:12:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2252 transitions. [2025-01-09 13:12:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:12:45,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:45,069 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:45,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:12:45,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:45,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:45,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:45,274 INFO L85 PathProgramCache]: Analyzing trace with hash 166556529, now seen corresponding path program 1 times [2025-01-09 13:12:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503853653] [2025-01-09 13:12:45,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:45,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:45,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:45,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:12:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503853653] [2025-01-09 13:12:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503853653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:12:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911844353] [2025-01-09 13:12:46,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:46,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:46,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:46,073 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 13:12:46,075 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 13:12:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:46,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:46,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:46,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:46,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 13:12:46,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:12:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:47,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:12:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911844353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:12:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-01-09 13:12:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100549216] [2025-01-09 13:12:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:12:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:47,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:12:47,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:12:47,608 INFO L87 Difference]: Start difference. First operand 1526 states and 2252 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:48,092 INFO L93 Difference]: Finished difference Result 3268 states and 4805 transitions. [2025-01-09 13:12:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:12:48,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-01-09 13:12:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:48,102 INFO L225 Difference]: With dead ends: 3268 [2025-01-09 13:12:48,102 INFO L226 Difference]: Without dead ends: 1816 [2025-01-09 13:12:48,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:12:48,108 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 139 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:48,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 736 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:12:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-01-09 13:12:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1612. [2025-01-09 13:12:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1221 states have (on average 1.348075348075348) internal successors, (1646), 1221 states have internal predecessors, (1646), 364 states have call successors, (364), 26 states have call predecessors, (364), 26 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-01-09 13:12:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2374 transitions. [2025-01-09 13:12:48,268 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2374 transitions. Word has length 196 [2025-01-09 13:12:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:48,269 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2374 transitions. [2025-01-09 13:12:48,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2374 transitions. [2025-01-09 13:12:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:12:48,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:48,270 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:48,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 13:12:48,471 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,SelfDestructingSolverStorable10 [2025-01-09 13:12:48,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 11211774, now seen corresponding path program 1 times [2025-01-09 13:12:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002057854] [2025-01-09 13:12:48,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:48,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:48,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:48,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:48,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002057854] [2025-01-09 13:12:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002057854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:48,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:12:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486725240] [2025-01-09 13:12:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:48,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:12:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:48,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:12:48,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:12:48,665 INFO L87 Difference]: Start difference. First operand 1612 states and 2374 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:49,341 INFO L93 Difference]: Finished difference Result 4606 states and 6800 transitions. [2025-01-09 13:12:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:12:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-01-09 13:12:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:49,354 INFO L225 Difference]: With dead ends: 4606 [2025-01-09 13:12:49,355 INFO L226 Difference]: Without dead ends: 3136 [2025-01-09 13:12:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:12:49,360 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 283 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:49,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 904 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:12:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-01-09 13:12:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2246. [2025-01-09 13:12:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1735 states have (on average 1.3481268011527376) internal successors, (2339), 1735 states have internal predecessors, (2339), 476 states have call successors, (476), 34 states have call predecessors, (476), 34 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2025-01-09 13:12:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3291 transitions. [2025-01-09 13:12:49,581 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3291 transitions. Word has length 196 [2025-01-09 13:12:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3291 transitions. [2025-01-09 13:12:49,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3291 transitions. [2025-01-09 13:12:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:12:49,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:49,583 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:49,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 13:12:49,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1982932932, now seen corresponding path program 1 times [2025-01-09 13:12:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:49,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620270392] [2025-01-09 13:12:49,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:49,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:49,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620270392] [2025-01-09 13:12:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620270392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:12:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104586214] [2025-01-09 13:12:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:12:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:50,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:12:50,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:12:50,095 INFO L87 Difference]: Start difference. First operand 2246 states and 3291 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:51,134 INFO L93 Difference]: Finished difference Result 4858 states and 7111 transitions. [2025-01-09 13:12:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:12:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-01-09 13:12:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:51,150 INFO L225 Difference]: With dead ends: 4858 [2025-01-09 13:12:51,150 INFO L226 Difference]: Without dead ends: 2788 [2025-01-09 13:12:51,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:12:51,157 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 486 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:51,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1016 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:12:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2025-01-09 13:12:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2256. [2025-01-09 13:12:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 1745 states have (on average 1.3484240687679083) internal successors, (2353), 1745 states have internal predecessors, (2353), 476 states have call successors, (476), 34 states have call predecessors, (476), 34 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2025-01-09 13:12:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3305 transitions. [2025-01-09 13:12:51,372 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3305 transitions. Word has length 196 [2025-01-09 13:12:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3305 transitions. [2025-01-09 13:12:51,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3305 transitions. [2025-01-09 13:12:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:12:51,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:51,376 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:12:51,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1904020021, now seen corresponding path program 1 times [2025-01-09 13:12:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940358934] [2025-01-09 13:12:51,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:51,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:51,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-01-09 13:12:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940358934] [2025-01-09 13:12:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940358934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:12:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137112184] [2025-01-09 13:12:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:51,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:51,726 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 13:12:51,730 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 13:12:51,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:12:51,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:12:51,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:51,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:51,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 13:12:51,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:12:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2025-01-09 13:12:51,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:12:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-01-09 13:12:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137112184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:12:52,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:12:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-01-09 13:12:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318523580] [2025-01-09 13:12:52,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:12:52,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:12:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:52,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:12:52,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:12:52,242 INFO L87 Difference]: Start difference. First operand 2256 states and 3305 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 13:12:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:52,721 INFO L93 Difference]: Finished difference Result 3486 states and 5037 transitions. [2025-01-09 13:12:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:12:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-01-09 13:12:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:52,729 INFO L225 Difference]: With dead ends: 3486 [2025-01-09 13:12:52,729 INFO L226 Difference]: Without dead ends: 1311 [2025-01-09 13:12:52,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2025-01-09 13:12:52,735 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 511 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:52,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 431 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:12:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-01-09 13:12:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1235. [2025-01-09 13:12:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 955 states have (on average 1.3162303664921466) internal successors, (1257), 955 states have internal predecessors, (1257), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:12:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1761 transitions. [2025-01-09 13:12:52,907 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1761 transitions. Word has length 196 [2025-01-09 13:12:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:52,907 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1761 transitions. [2025-01-09 13:12:52,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 13:12:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1761 transitions. [2025-01-09 13:12:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 13:12:52,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:52,909 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:52,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 13:12:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 13:12:53,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:53,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1736218705, now seen corresponding path program 1 times [2025-01-09 13:12:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052801679] [2025-01-09 13:12:53,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:53,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 13:12:53,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 13:12:53,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:53,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052801679] [2025-01-09 13:12:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052801679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:12:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236106450] [2025-01-09 13:12:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:53,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:12:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:53,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:12:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:12:53,506 INFO L87 Difference]: Start difference. First operand 1235 states and 1761 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:54,375 INFO L93 Difference]: Finished difference Result 2551 states and 3630 transitions. [2025-01-09 13:12:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:12:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-01-09 13:12:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:54,383 INFO L225 Difference]: With dead ends: 2551 [2025-01-09 13:12:54,384 INFO L226 Difference]: Without dead ends: 1445 [2025-01-09 13:12:54,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:12:54,387 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 306 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:54,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 616 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:12:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-09 13:12:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1253. [2025-01-09 13:12:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 973 states have (on average 1.313463514902364) internal successors, (1278), 973 states have internal predecessors, (1278), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:12:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1782 transitions. [2025-01-09 13:12:54,537 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1782 transitions. Word has length 197 [2025-01-09 13:12:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:54,539 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1782 transitions. [2025-01-09 13:12:54,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1782 transitions. [2025-01-09 13:12:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 13:12:54,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:54,545 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 13:12:54,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 869804849, now seen corresponding path program 1 times [2025-01-09 13:12:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156460880] [2025-01-09 13:12:54,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:54,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:54,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 13:12:54,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 13:12:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:12:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156460880] [2025-01-09 13:12:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156460880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:12:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:12:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:12:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557037967] [2025-01-09 13:12:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:12:54,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:12:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:54,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:12:54,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:12:54,859 INFO L87 Difference]: Start difference. First operand 1253 states and 1782 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:55,518 INFO L93 Difference]: Finished difference Result 2569 states and 3647 transitions. [2025-01-09 13:12:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:12:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-01-09 13:12:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:55,525 INFO L225 Difference]: With dead ends: 2569 [2025-01-09 13:12:55,525 INFO L226 Difference]: Without dead ends: 1445 [2025-01-09 13:12:55,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:12:55,528 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 281 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:55,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 729 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:12:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-09 13:12:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1225. [2025-01-09 13:12:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 945 states have (on average 1.307936507936508) internal successors, (1236), 945 states have internal predecessors, (1236), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:12:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1740 transitions. [2025-01-09 13:12:55,668 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1740 transitions. Word has length 197 [2025-01-09 13:12:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:55,669 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1740 transitions. [2025-01-09 13:12:55,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:12:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1740 transitions. [2025-01-09 13:12:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:12:55,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:55,670 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:55,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 13:12:55,670 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1389025350, now seen corresponding path program 1 times [2025-01-09 13:12:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120803826] [2025-01-09 13:12:55,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:55,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:12:55,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:12:55,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:55,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:12:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:12:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120803826] [2025-01-09 13:12:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120803826] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:12:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901258799] [2025-01-09 13:12:55,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:55,943 INFO L229 MonitoredProcess]: Starting monitored process 7 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 13:12:55,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 13:12:56,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:12:56,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:12:56,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:56,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:56,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 13:12:56,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:12:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 601 proven. 60 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2025-01-09 13:12:56,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:12:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:12:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901258799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:12:56,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:12:56,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2025-01-09 13:12:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773558128] [2025-01-09 13:12:56,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:12:56,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 13:12:56,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:12:56,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 13:12:56,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:12:56,780 INFO L87 Difference]: Start difference. First operand 1225 states and 1740 transitions. Second operand has 21 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 5 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) [2025-01-09 13:12:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:12:57,882 INFO L93 Difference]: Finished difference Result 3250 states and 4525 transitions. [2025-01-09 13:12:57,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 13:12:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 5 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) Word has length 198 [2025-01-09 13:12:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:12:57,890 INFO L225 Difference]: With dead ends: 3250 [2025-01-09 13:12:57,890 INFO L226 Difference]: Without dead ends: 2106 [2025-01-09 13:12:57,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 13:12:57,892 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1177 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:12:57,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1236 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:12:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2025-01-09 13:12:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1514. [2025-01-09 13:12:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1201 states have (on average 1.3039134054954205) internal successors, (1566), 1205 states have internal predecessors, (1566), 280 states have call successors, (280), 32 states have call predecessors, (280), 32 states have return successors, (280), 276 states have call predecessors, (280), 280 states have call successors, (280) [2025-01-09 13:12:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2126 transitions. [2025-01-09 13:12:58,073 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2126 transitions. Word has length 198 [2025-01-09 13:12:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:12:58,074 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2126 transitions. [2025-01-09 13:12:58,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 5 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) [2025-01-09 13:12:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2126 transitions. [2025-01-09 13:12:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:12:58,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:12:58,076 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:58,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 13:12:58,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 13:12:58,277 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:12:58,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:12:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1523038856, now seen corresponding path program 1 times [2025-01-09 13:12:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:12:58,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654352522] [2025-01-09 13:12:58,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:12:58,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:12:58,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:12:58,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:58,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:12:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027060347] [2025-01-09 13:12:58,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:12:58,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:12:58,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:12:58,351 INFO L229 MonitoredProcess]: Starting monitored process 8 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 13:12:58,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 13:12:58,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:12:59,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:12:59,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:12:59,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:12:59,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 13:12:59,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:13:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 947 proven. 180 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-01-09 13:13:02,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:13:18,395 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne)