./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-94.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 405e5789553fad6dda484b23004593a9ff8fb026279ba739bcf86517a37a2041 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:52:13,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:52:13,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:52:13,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:52:13,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:52:13,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:52:13,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:52:13,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:52:13,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:52:13,732 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:52:13,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:52:13,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:52:13,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:52:13,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:52:13,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:52:13,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:13,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:13,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:52:13,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:52:13,735 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 -> 405e5789553fad6dda484b23004593a9ff8fb026279ba739bcf86517a37a2041 [2025-01-09 14:52:13,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:52:13,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:52:13,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:52:13,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:52:13,999 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:52:13,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-94.i [2025-01-09 14:52:15,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa419ac0/b3807d6eb88b4ad7ae45a6cf208ff9cf/FLAG3bff9f090 [2025-01-09 14:52:15,508 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:52:15,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-94.i [2025-01-09 14:52:15,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa419ac0/b3807d6eb88b4ad7ae45a6cf208ff9cf/FLAG3bff9f090 [2025-01-09 14:52:15,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa419ac0/b3807d6eb88b4ad7ae45a6cf208ff9cf [2025-01-09 14:52:15,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:52:15,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:52:15,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:15,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:52:15,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:52:15,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:15" (1/1) ... [2025-01-09 14:52:15,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3294e71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:15, skipping insertion in model container [2025-01-09 14:52:15,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:15" (1/1) ... [2025-01-09 14:52:15,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:52:15,827 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-94.i[916,929] [2025-01-09 14:52:15,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:16,001 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:52:16,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-94.i[916,929] [2025-01-09 14:52:16,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:16,106 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:52:16,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16 WrapperNode [2025-01-09 14:52:16,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:16,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:16,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:52:16,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:52:16,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,232 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 797 [2025-01-09 14:52:16,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:16,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:52:16,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:52:16,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:52:16,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,344 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:52:16,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:52:16,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:52:16,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:52:16,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:52:16,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (1/1) ... [2025-01-09 14:52:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:16,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:16,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:52:16,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:52:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:52:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:52:16,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:52:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:52:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:52:16,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:52:16,613 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:52:16,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:52:17,525 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-01-09 14:52:17,525 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:52:17,535 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:52:17,535 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:52:17,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:17 BoogieIcfgContainer [2025-01-09 14:52:17,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:52:17,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:52:17,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:52:17,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:52:17,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:52:15" (1/3) ... [2025-01-09 14:52:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e94420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:17, skipping insertion in model container [2025-01-09 14:52:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:16" (2/3) ... [2025-01-09 14:52:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e94420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:17, skipping insertion in model container [2025-01-09 14:52:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:17" (3/3) ... [2025-01-09 14:52:17,542 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-94.i [2025-01-09 14:52:17,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:52:17,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-94.i that has 2 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:52:17,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:52:17,600 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;@19892220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:52:17,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:52:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 247 states have (on average 1.5506072874493928) internal successors, (383), 248 states have internal predecessors, (383), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:52:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-01-09 14:52:17,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:17,622 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:17,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1792547057, now seen corresponding path program 1 times [2025-01-09 14:52:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875794008] [2025-01-09 14:52:17,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:17,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-09 14:52:17,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-09 14:52:17,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:17,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-01-09 14:52:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875794008] [2025-01-09 14:52:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875794008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343535517] [2025-01-09 14:52:18,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:18,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:52:18,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:52:18,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-09 14:52:18,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-09 14:52:18,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:18,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:18,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:52:18,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-01-09 14:52:18,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:52:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343535517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:52:18,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:52:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036643932] [2025-01-09 14:52:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:18,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:52:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:18,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:52:18,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:52:18,597 INFO L87 Difference]: Start difference. First operand has 326 states, 247 states have (on average 1.5506072874493928) internal successors, (383), 248 states have internal predecessors, (383), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-01-09 14:52:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:18,660 INFO L93 Difference]: Finished difference Result 646 states and 1141 transitions. [2025-01-09 14:52:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:52:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 516 [2025-01-09 14:52:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:18,670 INFO L225 Difference]: With dead ends: 646 [2025-01-09 14:52:18,671 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 14:52:18,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:52:18,676 INFO L435 NwaCegarLoop]: 526 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, 526 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:18,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 14:52:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-01-09 14:52:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 245 states have (on average 1.526530612244898) internal successors, (374), 245 states have internal predecessors, (374), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:52:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 526 transitions. [2025-01-09 14:52:18,724 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 526 transitions. Word has length 516 [2025-01-09 14:52:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:18,725 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 526 transitions. [2025-01-09 14:52:18,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-01-09 14:52:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 526 transitions. [2025-01-09 14:52:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-01-09 14:52:18,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:18,738 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:18,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:52:18,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:52:18,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -872260773, now seen corresponding path program 1 times [2025-01-09 14:52:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772989480] [2025-01-09 14:52:18,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:18,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:18,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-09 14:52:19,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-09 14:52:19,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:19,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772989480] [2025-01-09 14:52:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772989480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146780401] [2025-01-09 14:52:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:19,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:19,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:19,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:19,456 INFO L87 Difference]: Start difference. First operand 323 states and 526 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:19,557 INFO L93 Difference]: Finished difference Result 869 states and 1415 transitions. [2025-01-09 14:52:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 516 [2025-01-09 14:52:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:19,566 INFO L225 Difference]: With dead ends: 869 [2025-01-09 14:52:19,566 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 14:52:19,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:19,569 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 350 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:19,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1164 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 14:52:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 546. [2025-01-09 14:52:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 431 states have (on average 1.5359628770301623) internal successors, (662), 432 states have internal predecessors, (662), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 14:52:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 886 transitions. [2025-01-09 14:52:19,632 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 886 transitions. Word has length 516 [2025-01-09 14:52:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 886 transitions. [2025-01-09 14:52:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 886 transitions. [2025-01-09 14:52:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 14:52:19,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:19,644 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:19,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:52:19,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:19,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1691985284, now seen corresponding path program 1 times [2025-01-09 14:52:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:19,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41013404] [2025-01-09 14:52:19,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:19,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:19,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:19,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:19,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:19,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41013404] [2025-01-09 14:52:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41013404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530733988] [2025-01-09 14:52:20,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:20,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:20,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:20,406 INFO L87 Difference]: Start difference. First operand 546 states and 886 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:20,731 INFO L93 Difference]: Finished difference Result 1985 states and 3229 transitions. [2025-01-09 14:52:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 517 [2025-01-09 14:52:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:20,741 INFO L225 Difference]: With dead ends: 1985 [2025-01-09 14:52:20,741 INFO L226 Difference]: Without dead ends: 1442 [2025-01-09 14:52:20,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:20,744 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 691 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:20,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1861 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-01-09 14:52:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1087. [2025-01-09 14:52:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 858 states have (on average 1.534965034965035) internal successors, (1317), 860 states have internal predecessors, (1317), 224 states have call successors, (224), 4 states have call predecessors, (224), 4 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 14:52:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1765 transitions. [2025-01-09 14:52:20,844 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1765 transitions. Word has length 517 [2025-01-09 14:52:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1765 transitions. [2025-01-09 14:52:20,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1765 transitions. [2025-01-09 14:52:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 14:52:20,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:20,852 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:20,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:52:20,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:20,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 723851066, now seen corresponding path program 1 times [2025-01-09 14:52:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:20,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470577156] [2025-01-09 14:52:20,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:20,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:21,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:21,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470577156] [2025-01-09 14:52:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470577156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390040152] [2025-01-09 14:52:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:21,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:21,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:21,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:21,570 INFO L87 Difference]: Start difference. First operand 1087 states and 1765 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:21,658 INFO L93 Difference]: Finished difference Result 2187 states and 3539 transitions. [2025-01-09 14:52:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 517 [2025-01-09 14:52:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:21,665 INFO L225 Difference]: With dead ends: 2187 [2025-01-09 14:52:21,665 INFO L226 Difference]: Without dead ends: 1103 [2025-01-09 14:52:21,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:21,668 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 365 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:21,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 651 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-01-09 14:52:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2025-01-09 14:52:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 870 states have (on average 1.525287356321839) internal successors, (1327), 872 states have internal predecessors, (1327), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 14:52:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1775 transitions. [2025-01-09 14:52:21,717 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1775 transitions. Word has length 517 [2025-01-09 14:52:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:21,717 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1775 transitions. [2025-01-09 14:52:21,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1775 transitions. [2025-01-09 14:52:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 14:52:21,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:21,723 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:52:21,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -492302660, now seen corresponding path program 1 times [2025-01-09 14:52:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707732972] [2025-01-09 14:52:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:21,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:22,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707732972] [2025-01-09 14:52:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707732972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104609102] [2025-01-09 14:52:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:22,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:22,651 INFO L87 Difference]: Start difference. First operand 1103 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:22,993 INFO L93 Difference]: Finished difference Result 3209 states and 5161 transitions. [2025-01-09 14:52:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 517 [2025-01-09 14:52:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:23,004 INFO L225 Difference]: With dead ends: 3209 [2025-01-09 14:52:23,004 INFO L226 Difference]: Without dead ends: 2109 [2025-01-09 14:52:23,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:23,007 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 780 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:23,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1627 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2025-01-09 14:52:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1411. [2025-01-09 14:52:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1178 states have (on average 1.5721561969439728) internal successors, (1852), 1180 states have internal predecessors, (1852), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 14:52:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2300 transitions. [2025-01-09 14:52:23,148 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2300 transitions. Word has length 517 [2025-01-09 14:52:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:23,149 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2300 transitions. [2025-01-09 14:52:23,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2300 transitions. [2025-01-09 14:52:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 14:52:23,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:23,156 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:23,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:52:23,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:23,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1466272126, now seen corresponding path program 1 times [2025-01-09 14:52:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083838657] [2025-01-09 14:52:23,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:23,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:23,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:23,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:24,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083838657] [2025-01-09 14:52:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083838657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:24,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:52:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426403770] [2025-01-09 14:52:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:24,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:52:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:24,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:52:24,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:24,353 INFO L87 Difference]: Start difference. First operand 1411 states and 2300 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:24,988 INFO L93 Difference]: Finished difference Result 5105 states and 8323 transitions. [2025-01-09 14:52:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:24,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 517 [2025-01-09 14:52:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:25,003 INFO L225 Difference]: With dead ends: 5105 [2025-01-09 14:52:25,004 INFO L226 Difference]: Without dead ends: 3697 [2025-01-09 14:52:25,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:25,008 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1921 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:25,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 1302 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:52:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2025-01-09 14:52:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 2635. [2025-01-09 14:52:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2400 states have (on average 1.6329166666666666) internal successors, (3919), 2402 states have internal predecessors, (3919), 224 states have call successors, (224), 10 states have call predecessors, (224), 10 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 14:52:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4367 transitions. [2025-01-09 14:52:25,161 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4367 transitions. Word has length 517 [2025-01-09 14:52:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:25,162 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 4367 transitions. [2025-01-09 14:52:25,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4367 transitions. [2025-01-09 14:52:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 14:52:25,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:25,166 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:25,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:52:25,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:25,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1032543040, now seen corresponding path program 1 times [2025-01-09 14:52:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:25,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722009432] [2025-01-09 14:52:25,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:25,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:25,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:25,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:26,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:26,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722009432] [2025-01-09 14:52:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722009432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:26,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:26,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702278159] [2025-01-09 14:52:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:26,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:26,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:26,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:26,056 INFO L87 Difference]: Start difference. First operand 2635 states and 4367 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:26,509 INFO L93 Difference]: Finished difference Result 7065 states and 11649 transitions. [2025-01-09 14:52:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 517 [2025-01-09 14:52:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:26,525 INFO L225 Difference]: With dead ends: 7065 [2025-01-09 14:52:26,525 INFO L226 Difference]: Without dead ends: 4433 [2025-01-09 14:52:26,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:26,529 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 954 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:26,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1501 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2025-01-09 14:52:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 1859. [2025-01-09 14:52:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1698 states have (on average 1.6313309776207303) internal successors, (2770), 1698 states have internal predecessors, (2770), 152 states have call successors, (152), 8 states have call predecessors, (152), 8 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 14:52:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 3074 transitions. [2025-01-09 14:52:26,665 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 3074 transitions. Word has length 517 [2025-01-09 14:52:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:26,666 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 3074 transitions. [2025-01-09 14:52:26,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3074 transitions. [2025-01-09 14:52:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 14:52:26,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:26,671 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:26,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:52:26,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 679454658, now seen corresponding path program 1 times [2025-01-09 14:52:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723398483] [2025-01-09 14:52:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:26,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:27,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:27,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:27,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 111 proven. 114 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:52:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:27,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723398483] [2025-01-09 14:52:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723398483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:27,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973435728] [2025-01-09 14:52:27,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:27,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:52:27,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:52:28,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 14:52:28,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 14:52:28,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:28,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:28,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:52:28,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5769 proven. 108 refuted. 0 times theorem prover too weak. 5523 trivial. 0 not checked. [2025-01-09 14:52:28,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 117 proven. 108 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:52:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973435728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:29,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:52:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367048632] [2025-01-09 14:52:29,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:29,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:52:29,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:29,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:52:29,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:52:29,063 INFO L87 Difference]: Start difference. First operand 1859 states and 3074 transitions. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 3 states have call predecessors, (152), 3 states have call successors, (152) [2025-01-09 14:52:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:29,609 INFO L93 Difference]: Finished difference Result 2989 states and 4881 transitions. [2025-01-09 14:52:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:52:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 3 states have call predecessors, (152), 3 states have call successors, (152) Word has length 517 [2025-01-09 14:52:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:29,616 INFO L225 Difference]: With dead ends: 2989 [2025-01-09 14:52:29,617 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 14:52:29,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1031 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:52:29,620 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 612 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:29,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1040 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:52:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 14:52:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1041. [2025-01-09 14:52:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 878 states have (on average 1.5341685649202734) internal successors, (1347), 878 states have internal predecessors, (1347), 152 states have call successors, (152), 10 states have call predecessors, (152), 10 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 14:52:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1651 transitions. [2025-01-09 14:52:29,672 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1651 transitions. Word has length 517 [2025-01-09 14:52:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:29,674 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1651 transitions. [2025-01-09 14:52:29,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 3 states have call predecessors, (152), 3 states have call successors, (152) [2025-01-09 14:52:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1651 transitions. [2025-01-09 14:52:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 14:52:29,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:29,677 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:29,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:52:29,877 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 14:52:29,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash -623654586, now seen corresponding path program 1 times [2025-01-09 14:52:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172606524] [2025-01-09 14:52:29,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:29,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172606524] [2025-01-09 14:52:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172606524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:30,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:30,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247822263] [2025-01-09 14:52:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:30,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:30,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:30,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:30,213 INFO L87 Difference]: Start difference. First operand 1041 states and 1651 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:30,267 INFO L93 Difference]: Finished difference Result 2079 states and 3299 transitions. [2025-01-09 14:52:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:30,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 519 [2025-01-09 14:52:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:30,272 INFO L225 Difference]: With dead ends: 2079 [2025-01-09 14:52:30,272 INFO L226 Difference]: Without dead ends: 1041 [2025-01-09 14:52:30,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:30,274 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 488 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:30,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 492 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-01-09 14:52:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2025-01-09 14:52:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 878 states have (on average 1.529612756264237) internal successors, (1343), 878 states have internal predecessors, (1343), 152 states have call successors, (152), 10 states have call predecessors, (152), 10 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 14:52:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1647 transitions. [2025-01-09 14:52:30,373 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1647 transitions. Word has length 519 [2025-01-09 14:52:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:30,374 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1647 transitions. [2025-01-09 14:52:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1647 transitions. [2025-01-09 14:52:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 14:52:30,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:30,379 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:52:30,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash -546753788, now seen corresponding path program 1 times [2025-01-09 14:52:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691204455] [2025-01-09 14:52:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:30,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:30,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:30,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:30,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691204455] [2025-01-09 14:52:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691204455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:52:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643127869] [2025-01-09 14:52:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:52:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:31,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:52:31,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:31,632 INFO L87 Difference]: Start difference. First operand 1041 states and 1647 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:32,285 INFO L93 Difference]: Finished difference Result 3551 states and 5626 transitions. [2025-01-09 14:52:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:52:32,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 519 [2025-01-09 14:52:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:32,295 INFO L225 Difference]: With dead ends: 3551 [2025-01-09 14:52:32,295 INFO L226 Difference]: Without dead ends: 2513 [2025-01-09 14:52:32,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:32,298 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 935 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:32,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 2652 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:52:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-01-09 14:52:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1786. [2025-01-09 14:52:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1586 states have (on average 1.5542244640605296) internal successors, (2465), 1587 states have internal predecessors, (2465), 186 states have call successors, (186), 13 states have call predecessors, (186), 13 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:52:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2837 transitions. [2025-01-09 14:52:32,424 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2837 transitions. Word has length 519 [2025-01-09 14:52:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:32,425 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2837 transitions. [2025-01-09 14:52:32,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2837 transitions. [2025-01-09 14:52:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 14:52:32,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:32,430 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:32,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:52:32,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:32,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1670876610, now seen corresponding path program 1 times [2025-01-09 14:52:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138959862] [2025-01-09 14:52:32,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:32,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:33,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:33,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:33,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 96 proven. 129 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:52:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138959862] [2025-01-09 14:52:33,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138959862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:33,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965511988] [2025-01-09 14:52:33,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:33,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:33,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:52:33,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:52:33,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:34,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:34,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:34,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:34,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:52:34,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5733 proven. 102 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-01-09 14:52:34,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 123 proven. 102 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:52:35,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965511988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:35,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:35,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 17 [2025-01-09 14:52:35,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525542718] [2025-01-09 14:52:35,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:35,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:52:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:35,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:52:35,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:52:35,642 INFO L87 Difference]: Start difference. First operand 1786 states and 2837 transitions. Second operand has 17 states, 17 states have (on average 18.294117647058822) internal successors, (311), 17 states have internal predecessors, (311), 5 states have call successors, (195), 3 states have call predecessors, (195), 6 states have return successors, (196), 5 states have call predecessors, (196), 5 states have call successors, (196) [2025-01-09 14:52:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:36,883 INFO L93 Difference]: Finished difference Result 2800 states and 4377 transitions. [2025-01-09 14:52:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:52:36,889 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.294117647058822) internal successors, (311), 17 states have internal predecessors, (311), 5 states have call successors, (195), 3 states have call predecessors, (195), 6 states have return successors, (196), 5 states have call predecessors, (196), 5 states have call successors, (196) Word has length 519 [2025-01-09 14:52:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:36,894 INFO L225 Difference]: With dead ends: 2800 [2025-01-09 14:52:36,894 INFO L226 Difference]: Without dead ends: 1074 [2025-01-09 14:52:36,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=708, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:52:36,898 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2434 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:36,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 1611 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:52:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-01-09 14:52:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1046. [2025-01-09 14:52:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 838 states have (on average 1.4331742243436754) internal successors, (1201), 839 states have internal predecessors, (1201), 186 states have call successors, (186), 21 states have call predecessors, (186), 21 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:52:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1573 transitions. [2025-01-09 14:52:37,052 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1573 transitions. Word has length 519 [2025-01-09 14:52:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:37,053 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1573 transitions. [2025-01-09 14:52:37,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.294117647058822) internal successors, (311), 17 states have internal predecessors, (311), 5 states have call successors, (195), 3 states have call predecessors, (195), 6 states have return successors, (196), 5 states have call predecessors, (196), 5 states have call successors, (196) [2025-01-09 14:52:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1573 transitions. [2025-01-09 14:52:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 14:52:37,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:37,056 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:37,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:52:37,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:37,261 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:37,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:37,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1867579016, now seen corresponding path program 1 times [2025-01-09 14:52:37,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:37,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95870744] [2025-01-09 14:52:37,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:37,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:37,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:37,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:37,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:52:38,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:38,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95870744] [2025-01-09 14:52:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95870744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:52:38,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623875453] [2025-01-09 14:52:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:38,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:52:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:38,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:52:38,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:38,451 INFO L87 Difference]: Start difference. First operand 1046 states and 1573 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:38,708 INFO L93 Difference]: Finished difference Result 2028 states and 3050 transitions. [2025-01-09 14:52:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:52:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 519 [2025-01-09 14:52:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:38,713 INFO L225 Difference]: With dead ends: 2028 [2025-01-09 14:52:38,713 INFO L226 Difference]: Without dead ends: 1050 [2025-01-09 14:52:38,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:38,715 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 295 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:38,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1870 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-01-09 14:52:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1046. [2025-01-09 14:52:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 838 states have (on average 1.4307875894988067) internal successors, (1199), 839 states have internal predecessors, (1199), 186 states have call successors, (186), 21 states have call predecessors, (186), 21 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:52:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1571 transitions. [2025-01-09 14:52:38,789 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1571 transitions. Word has length 519 [2025-01-09 14:52:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1571 transitions. [2025-01-09 14:52:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:52:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1571 transitions. [2025-01-09 14:52:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 14:52:38,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:38,792 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:38,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:52:38,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 279231114, now seen corresponding path program 1 times [2025-01-09 14:52:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:38,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563263624] [2025-01-09 14:52:38,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:38,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:39,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:39,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:39,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 339 proven. 105 refuted. 0 times theorem prover too weak. 10956 trivial. 0 not checked. [2025-01-09 14:52:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563263624] [2025-01-09 14:52:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563263624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600040064] [2025-01-09 14:52:40,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:40,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:40,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:52:40,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:52:40,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 14:52:40,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 14:52:40,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:40,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:40,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 14:52:40,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 7494 proven. 429 refuted. 0 times theorem prover too weak. 3477 trivial. 0 not checked. [2025-01-09 14:52:42,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 174 proven. 51 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:52:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600040064] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:42,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:42,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 5] total 17 [2025-01-09 14:52:42,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749682092] [2025-01-09 14:52:42,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:42,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:52:42,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:52:42,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:52:42,727 INFO L87 Difference]: Start difference. First operand 1046 states and 1571 transitions. Second operand has 17 states, 17 states have (on average 17.705882352941178) internal successors, (301), 17 states have internal predecessors, (301), 7 states have call successors, (139), 4 states have call predecessors, (139), 8 states have return successors, (142), 7 states have call predecessors, (142), 7 states have call successors, (142) [2025-01-09 14:52:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:43,804 INFO L93 Difference]: Finished difference Result 2764 states and 4137 transitions. [2025-01-09 14:52:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:52:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 17.705882352941178) internal successors, (301), 17 states have internal predecessors, (301), 7 states have call successors, (139), 4 states have call predecessors, (139), 8 states have return successors, (142), 7 states have call predecessors, (142), 7 states have call successors, (142) Word has length 519 [2025-01-09 14:52:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:43,811 INFO L225 Difference]: With dead ends: 2764 [2025-01-09 14:52:43,811 INFO L226 Difference]: Without dead ends: 1786 [2025-01-09 14:52:43,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=366, Invalid=824, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 14:52:43,814 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1770 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:43,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 1600 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:52:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-01-09 14:52:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1402. [2025-01-09 14:52:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1183 states have (on average 1.4691462383770075) internal successors, (1738), 1184 states have internal predecessors, (1738), 186 states have call successors, (186), 32 states have call predecessors, (186), 32 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:52:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2110 transitions. [2025-01-09 14:52:44,014 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2110 transitions. Word has length 519 [2025-01-09 14:52:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2110 transitions. [2025-01-09 14:52:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 17.705882352941178) internal successors, (301), 17 states have internal predecessors, (301), 7 states have call successors, (139), 4 states have call predecessors, (139), 8 states have return successors, (142), 7 states have call predecessors, (142), 7 states have call successors, (142) [2025-01-09 14:52:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2110 transitions. [2025-01-09 14:52:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:52:44,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:44,022 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:44,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:52:44,222 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,SelfDestructingSolverStorable12 [2025-01-09 14:52:44,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:44,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1847487056, now seen corresponding path program 1 times [2025-01-09 14:52:44,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:44,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086242181] [2025-01-09 14:52:44,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:44,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:52:45,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:52:45,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:45,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 12 proven. 213 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:52:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086242181] [2025-01-09 14:52:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086242181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602744727] [2025-01-09 14:52:47,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:47,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:47,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:52:47,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:52:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:52:47,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:52:47,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:47,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:47,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 14:52:47,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 1840 proven. 414 refuted. 0 times theorem prover too weak. 9146 trivial. 0 not checked. [2025-01-09 14:52:50,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 30 proven. 417 refuted. 0 times theorem prover too weak. 10953 trivial. 0 not checked. [2025-01-09 14:52:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602744727] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:52,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:52,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2025-01-09 14:52:52,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182143391] [2025-01-09 14:52:52,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:52,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 14:52:52,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:52,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 14:52:52,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:52:52,099 INFO L87 Difference]: Start difference. First operand 1402 states and 2110 transitions. Second operand has 34 states, 34 states have (on average 11.235294117647058) internal successors, (382), 34 states have internal predecessors, (382), 9 states have call successors, (228), 4 states have call predecessors, (228), 9 states have return successors, (228), 9 states have call predecessors, (228), 9 states have call successors, (228) [2025-01-09 14:52:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:57,067 INFO L93 Difference]: Finished difference Result 8092 states and 12144 transitions. [2025-01-09 14:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 14:52:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 11.235294117647058) internal successors, (382), 34 states have internal predecessors, (382), 9 states have call successors, (228), 4 states have call predecessors, (228), 9 states have return successors, (228), 9 states have call predecessors, (228), 9 states have call successors, (228) Word has length 520 [2025-01-09 14:52:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:57,108 INFO L225 Difference]: With dead ends: 8092 [2025-01-09 14:52:57,108 INFO L226 Difference]: Without dead ends: 6762 [2025-01-09 14:52:57,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1432, Invalid=5708, Unknown=0, NotChecked=0, Total=7140 [2025-01-09 14:52:57,115 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 6270 mSDsluCounter, 6297 mSDsCounter, 0 mSdLazyCounter, 4000 mSolverCounterSat, 1174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6275 SdHoareTripleChecker+Valid, 6663 SdHoareTripleChecker+Invalid, 5174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1174 IncrementalHoareTripleChecker+Valid, 4000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:57,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6275 Valid, 6663 Invalid, 5174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1174 Valid, 4000 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 14:52:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2025-01-09 14:52:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 4914. [2025-01-09 14:52:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4414 states have (on average 1.4966017217942909) internal successors, (6606), 4419 states have internal predecessors, (6606), 412 states have call successors, (412), 87 states have call predecessors, (412), 87 states have return successors, (412), 407 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 14:52:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 7430 transitions. [2025-01-09 14:52:57,515 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 7430 transitions. Word has length 520 [2025-01-09 14:52:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:57,516 INFO L471 AbstractCegarLoop]: Abstraction has 4914 states and 7430 transitions. [2025-01-09 14:52:57,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.235294117647058) internal successors, (382), 34 states have internal predecessors, (382), 9 states have call successors, (228), 4 states have call predecessors, (228), 9 states have return successors, (228), 9 states have call predecessors, (228), 9 states have call successors, (228) [2025-01-09 14:52:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 7430 transitions. [2025-01-09 14:52:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:52:57,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:57,520 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:57,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:52:57,721 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 14:52:57,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:57,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2122246670, now seen corresponding path program 1 times [2025-01-09 14:52:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34449624] [2025-01-09 14:52:57,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:57,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:52:59,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:52:59,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:59,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:52:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344440923] [2025-01-09 14:52:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:59,612 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 14:52:59,614 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 14:52:59,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:00,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:00,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:00,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:00,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 14:53:00,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6749 proven. 675 refuted. 0 times theorem prover too weak. 3976 trivial. 0 not checked. [2025-01-09 14:53:07,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:53:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34449624] [2025-01-09 14:53:10,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:53:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344440923] [2025-01-09 14:53:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344440923] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:10,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:53:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2025-01-09 14:53:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414968851] [2025-01-09 14:53:10,608 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:53:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 14:53:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:10,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 14:53:10,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1683, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 14:53:10,610 INFO L87 Difference]: Start difference. First operand 4914 states and 7430 transitions. Second operand has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 29 states have internal predecessors, (167), 5 states have call successors, (76), 5 states have call predecessors, (76), 9 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) [2025-01-09 14:53:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:20,663 INFO L93 Difference]: Finished difference Result 14032 states and 21013 transitions. [2025-01-09 14:53:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 14:53:20,664 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 29 states have internal predecessors, (167), 5 states have call successors, (76), 5 states have call predecessors, (76), 9 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) Word has length 520 [2025-01-09 14:53:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:20,686 INFO L225 Difference]: With dead ends: 14032 [2025-01-09 14:53:20,686 INFO L226 Difference]: Without dead ends: 9198 [2025-01-09 14:53:20,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1475, Invalid=6007, Unknown=0, NotChecked=0, Total=7482 [2025-01-09 14:53:20,696 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 3854 mSDsluCounter, 6387 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3858 SdHoareTripleChecker+Valid, 6800 SdHoareTripleChecker+Invalid, 5497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:20,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3858 Valid, 6800 Invalid, 5497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-01-09 14:53:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9198 states. [2025-01-09 14:53:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9198 to 7897. [2025-01-09 14:53:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7897 states, 7052 states have (on average 1.4861032331253545) internal successors, (10480), 7060 states have internal predecessors, (10480), 684 states have call successors, (684), 160 states have call predecessors, (684), 160 states have return successors, (684), 676 states have call predecessors, (684), 684 states have call successors, (684) [2025-01-09 14:53:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 11848 transitions. [2025-01-09 14:53:21,276 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 11848 transitions. Word has length 520 [2025-01-09 14:53:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:21,277 INFO L471 AbstractCegarLoop]: Abstraction has 7897 states and 11848 transitions. [2025-01-09 14:53:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 29 states have internal predecessors, (167), 5 states have call successors, (76), 5 states have call predecessors, (76), 9 states have return successors, (76), 5 states have call predecessors, (76), 5 states have call successors, (76) [2025-01-09 14:53:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 11848 transitions. [2025-01-09 14:53:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:53:21,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:21,281 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:53:21,292 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 14:53:21,482 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,SelfDestructingSolverStorable14 [2025-01-09 14:53:21,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1569683483, now seen corresponding path program 1 times [2025-01-09 14:53:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386917382] [2025-01-09 14:53:21,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:21,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:22,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:22,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:22,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:53:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800781297] [2025-01-09 14:53:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:22,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:22,587 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 14:53:22,592 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 14:53:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:23,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:23,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 14:53:23,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6612 proven. 267 refuted. 0 times theorem prover too weak. 4521 trivial. 0 not checked. [2025-01-09 14:53:23,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:53:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386917382] [2025-01-09 14:53:24,171 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:53:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800781297] [2025-01-09 14:53:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800781297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:24,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:53:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-01-09 14:53:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309650662] [2025-01-09 14:53:24,172 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:53:24,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 14:53:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:24,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 14:53:24,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:53:24,173 INFO L87 Difference]: Start difference. First operand 7897 states and 11848 transitions. Second operand has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 18 states have internal predecessors, (170), 6 states have call successors, (76), 6 states have call predecessors, (76), 10 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-01-09 14:53:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:25,874 INFO L93 Difference]: Finished difference Result 22133 states and 33299 transitions. [2025-01-09 14:53:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:53:25,875 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 18 states have internal predecessors, (170), 6 states have call successors, (76), 6 states have call predecessors, (76), 10 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 520 [2025-01-09 14:53:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:25,907 INFO L225 Difference]: With dead ends: 22133 [2025-01-09 14:53:25,907 INFO L226 Difference]: Without dead ends: 14324 [2025-01-09 14:53:25,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:53:25,920 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1748 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:25,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 2451 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:53:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14324 states. [2025-01-09 14:53:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14324 to 8079. [2025-01-09 14:53:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8079 states, 7218 states have (on average 1.4749238016070934) internal successors, (10646), 7226 states have internal predecessors, (10646), 656 states have call successors, (656), 204 states have call predecessors, (656), 204 states have return successors, (656), 648 states have call predecessors, (656), 656 states have call successors, (656) [2025-01-09 14:53:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8079 states to 8079 states and 11958 transitions. [2025-01-09 14:53:26,580 INFO L78 Accepts]: Start accepts. Automaton has 8079 states and 11958 transitions. Word has length 520 [2025-01-09 14:53:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:26,581 INFO L471 AbstractCegarLoop]: Abstraction has 8079 states and 11958 transitions. [2025-01-09 14:53:26,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 18 states have internal predecessors, (170), 6 states have call successors, (76), 6 states have call predecessors, (76), 10 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-01-09 14:53:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8079 states and 11958 transitions. [2025-01-09 14:53:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:53:26,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:26,586 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:53:26,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 14:53:26,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:26,790 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:26,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1152286877, now seen corresponding path program 1 times [2025-01-09 14:53:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:26,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153032396] [2025-01-09 14:53:26,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:26,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:26,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:26,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:26,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:53:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153032396] [2025-01-09 14:53:27,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153032396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:27,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:53:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66388994] [2025-01-09 14:53:27,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:53:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:27,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:53:27,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:27,151 INFO L87 Difference]: Start difference. First operand 8079 states and 11958 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:53:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:28,180 INFO L93 Difference]: Finished difference Result 23941 states and 35478 transitions. [2025-01-09 14:53:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:53:28,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 520 [2025-01-09 14:53:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:28,212 INFO L225 Difference]: With dead ends: 23941 [2025-01-09 14:53:28,213 INFO L226 Difference]: Without dead ends: 15958 [2025-01-09 14:53:28,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:28,226 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 312 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:28,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 950 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2025-01-09 14:53:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15701. [2025-01-09 14:53:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15701 states, 14072 states have (on average 1.4708641273450824) internal successors, (20698), 14086 states have internal predecessors, (20698), 1242 states have call successors, (1242), 386 states have call predecessors, (1242), 386 states have return successors, (1242), 1228 states have call predecessors, (1242), 1242 states have call successors, (1242) [2025-01-09 14:53:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15701 states to 15701 states and 23182 transitions. [2025-01-09 14:53:29,370 INFO L78 Accepts]: Start accepts. Automaton has 15701 states and 23182 transitions. Word has length 520 [2025-01-09 14:53:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:29,370 INFO L471 AbstractCegarLoop]: Abstraction has 15701 states and 23182 transitions. [2025-01-09 14:53:29,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:53:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 15701 states and 23182 transitions. [2025-01-09 14:53:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 14:53:29,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:29,377 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:53:29,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:53:29,378 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:29,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash -876299233, now seen corresponding path program 1 times [2025-01-09 14:53:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:29,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382396255] [2025-01-09 14:53:29,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:29,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:53:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507383321] [2025-01-09 14:53:31,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:31,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:31,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:53:31,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 14:53:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:53:32,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:53:32,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 14:53:32,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 14:53:32,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat