./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.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_amount250_file-1.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 202a0432e117f9058bd61aa67403e31b42b1f3767a8cd5b20aabf9e04f737968 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:19:41,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:19:41,391 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:19:41,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:19:41,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:19:41,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:19:41,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:19:41,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:19:41,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:19:41,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:19:41,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:19:41,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:19:41,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:19:41,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:19:41,416 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:19:41,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:19:41,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:19:41,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:41,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:41,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:19:41,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:19:41,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:19:41,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:19:41,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:19:41,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:19:41,419 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 -> 202a0432e117f9058bd61aa67403e31b42b1f3767a8cd5b20aabf9e04f737968 [2025-01-09 14:19:41,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:19:41,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:19:41,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:19:41,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:19:41,638 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:19:41,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.i [2025-01-09 14:19:42,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6b8417e1/26b256b9a36e49b4a3a993d194144266/FLAGec6039851 [2025-01-09 14:19:43,034 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:19:43,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.i [2025-01-09 14:19:43,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6b8417e1/26b256b9a36e49b4a3a993d194144266/FLAGec6039851 [2025-01-09 14:19:43,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6b8417e1/26b256b9a36e49b4a3a993d194144266 [2025-01-09 14:19:43,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:19:43,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:19:43,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:43,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:19:43,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:19:43,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43, skipping insertion in model container [2025-01-09 14:19:43,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:19:43,447 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_amount250_file-1.i[915,928] [2025-01-09 14:19:43,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:43,572 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:19:43,579 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_amount250_file-1.i[915,928] [2025-01-09 14:19:43,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:43,657 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:19:43,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43 WrapperNode [2025-01-09 14:19:43,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:43,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:43,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:19:43,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:19:43,665 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:19:43" (1/1) ... [2025-01-09 14:19:43,677 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:19:43" (1/1) ... [2025-01-09 14:19:43,717 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 397 [2025-01-09 14:19:43,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:43,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:19:43,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:19:43,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:19:43,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,762 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:19:43,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:19:43,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:19:43,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:19:43,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:19:43,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (1/1) ... [2025-01-09 14:19:43,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:43,831 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:19:43,833 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:19:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:19:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:19:43,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:19:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:19:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:19:43,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:19:43,937 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:19:43,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:19:44,539 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-01-09 14:19:44,539 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:19:44,549 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:19:44,549 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:19:44,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:44 BoogieIcfgContainer [2025-01-09 14:19:44,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:19:44,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:19:44,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:19:44,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:19:44,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:19:43" (1/3) ... [2025-01-09 14:19:44,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f2c403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:44, skipping insertion in model container [2025-01-09 14:19:44,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:43" (2/3) ... [2025-01-09 14:19:44,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f2c403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:44, skipping insertion in model container [2025-01-09 14:19:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:44" (3/3) ... [2025-01-09 14:19:44,557 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-1.i [2025-01-09 14:19:44,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:19:44,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-1.i that has 2 procedures, 157 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:19:44,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:19:44,619 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;@54e2c60d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:19:44,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:19:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 112 states have internal predecessors, (172), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:19:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-09 14:19:44,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:44,638 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:44,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 254100720, now seen corresponding path program 1 times [2025-01-09 14:19:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:44,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386123112] [2025-01-09 14:19:44,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:44,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:19:44,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:19:44,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 14:19:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386123112] [2025-01-09 14:19:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386123112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932459779] [2025-01-09 14:19:45,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:45,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:45,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:45,046 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:19:45,047 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:19:45,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:19:45,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:19:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:45,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:19:45,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 14:19:45,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932459779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:19:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:19:45,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410578014] [2025-01-09 14:19:45,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:45,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:19:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:45,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:19:45,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:19:45,301 INFO L87 Difference]: Start difference. First operand has 157 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 112 states have internal predecessors, (172), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:19:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:45,328 INFO L93 Difference]: Finished difference Result 308 states and 554 transitions. [2025-01-09 14:19:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:19:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2025-01-09 14:19:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:45,334 INFO L225 Difference]: With dead ends: 308 [2025-01-09 14:19:45,334 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 14:19:45,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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:19:45,341 INFO L435 NwaCegarLoop]: 253 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, 253 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:19:45,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 14:19:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-09 14:19:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 109 states have internal predecessors, (167), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:19:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 253 transitions. [2025-01-09 14:19:45,379 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 253 transitions. Word has length 285 [2025-01-09 14:19:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:45,379 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 253 transitions. [2025-01-09 14:19:45,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:19:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 253 transitions. [2025-01-09 14:19:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-09 14:19:45,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:45,383 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:19:45,584 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:19:45,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1265198198, now seen corresponding path program 1 times [2025-01-09 14:19:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309361045] [2025-01-09 14:19:45,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:19:45,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:19:45,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:45,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309361045] [2025-01-09 14:19:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309361045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:19:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003990116] [2025-01-09 14:19:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:45,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:19:45,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:45,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:19:45,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:45,861 INFO L87 Difference]: Start difference. First operand 154 states and 253 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:45,931 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2025-01-09 14:19:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-01-09 14:19:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:45,936 INFO L225 Difference]: With dead ends: 372 [2025-01-09 14:19:45,937 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 14:19:45,937 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:19:45,938 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 106 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:45,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 482 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 14:19:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2025-01-09 14:19:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 117 states have internal predecessors, (180), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:19:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 266 transitions. [2025-01-09 14:19:45,961 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 266 transitions. Word has length 285 [2025-01-09 14:19:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:45,963 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 266 transitions. [2025-01-09 14:19:45,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 266 transitions. [2025-01-09 14:19:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-09 14:19:45,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:45,967 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:19:45,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1327237812, now seen corresponding path program 1 times [2025-01-09 14:19:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289703117] [2025-01-09 14:19:45,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:45,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:19:46,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:19:46,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:46,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289703117] [2025-01-09 14:19:46,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289703117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:46,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:46,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:19:46,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559492243] [2025-01-09 14:19:46,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:46,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:19:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:46,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:19:46,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:46,552 INFO L87 Difference]: Start difference. First operand 162 states and 266 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:46,617 INFO L93 Difference]: Finished difference Result 480 states and 792 transitions. [2025-01-09 14:19:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:46,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-01-09 14:19:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:46,620 INFO L225 Difference]: With dead ends: 480 [2025-01-09 14:19:46,620 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 14:19:46,624 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:19:46,625 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 152 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:46,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 488 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 14:19:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-01-09 14:19:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 230 states have internal predecessors, (354), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:19:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 526 transitions. [2025-01-09 14:19:46,665 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 526 transitions. Word has length 285 [2025-01-09 14:19:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:46,665 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 526 transitions. [2025-01-09 14:19:46,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 526 transitions. [2025-01-09 14:19:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-09 14:19:46,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:46,668 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:46,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:19:46,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:46,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash -261110090, now seen corresponding path program 1 times [2025-01-09 14:19:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827563853] [2025-01-09 14:19:46,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 14:19:47,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 14:19:47,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:47,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:47,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827563853] [2025-01-09 14:19:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827563853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:47,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:47,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:19:47,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018967866] [2025-01-09 14:19:47,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:47,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:19:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:47,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:19:47,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:19:47,561 INFO L87 Difference]: Start difference. First operand 319 states and 526 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:47,956 INFO L93 Difference]: Finished difference Result 922 states and 1524 transitions. [2025-01-09 14:19:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:19:47,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-01-09 14:19:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:47,965 INFO L225 Difference]: With dead ends: 922 [2025-01-09 14:19:47,966 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 14:19:47,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:19:47,967 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 344 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:47,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 947 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:19:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 14:19:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2025-01-09 14:19:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 351 states have (on average 1.5384615384615385) internal successors, (540), 351 states have internal predecessors, (540), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 14:19:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 798 transitions. [2025-01-09 14:19:48,016 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 798 transitions. Word has length 285 [2025-01-09 14:19:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:48,016 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 798 transitions. [2025-01-09 14:19:48,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 798 transitions. [2025-01-09 14:19:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 14:19:48,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:48,019 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:19:48,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1392268152, now seen corresponding path program 1 times [2025-01-09 14:19:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943933728] [2025-01-09 14:19:48,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:48,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 14:19:48,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 14:19:48,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943933728] [2025-01-09 14:19:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943933728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:19:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867163248] [2025-01-09 14:19:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:19:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:19:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:19:48,770 INFO L87 Difference]: Start difference. First operand 484 states and 798 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:49,210 INFO L93 Difference]: Finished difference Result 994 states and 1650 transitions. [2025-01-09 14:19:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:19:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 287 [2025-01-09 14:19:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:49,215 INFO L225 Difference]: With dead ends: 994 [2025-01-09 14:19:49,218 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 14:19:49,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:19:49,219 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 183 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:49,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 849 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:19:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 14:19:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 484. [2025-01-09 14:19:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 351 states have (on average 1.5356125356125356) internal successors, (539), 351 states have internal predecessors, (539), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 14:19:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 797 transitions. [2025-01-09 14:19:49,279 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 797 transitions. Word has length 287 [2025-01-09 14:19:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:49,282 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 797 transitions. [2025-01-09 14:19:49,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 797 transitions. [2025-01-09 14:19:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 14:19:49,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:49,286 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:19:49,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1057331978, now seen corresponding path program 1 times [2025-01-09 14:19:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823328939] [2025-01-09 14:19:49,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:49,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 14:19:49,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 14:19:49,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:49,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823328939] [2025-01-09 14:19:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823328939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:19:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110092013] [2025-01-09 14:19:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:19:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:19:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:19:49,827 INFO L87 Difference]: Start difference. First operand 484 states and 797 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:50,052 INFO L93 Difference]: Finished difference Result 1043 states and 1736 transitions. [2025-01-09 14:19:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:19:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 287 [2025-01-09 14:19:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:50,057 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 14:19:50,057 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 14:19:50,058 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:19:50,059 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 170 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:50,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 737 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:19:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 14:19:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 484. [2025-01-09 14:19:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 351 states have (on average 1.5327635327635327) internal successors, (538), 351 states have internal predecessors, (538), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 14:19:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 796 transitions. [2025-01-09 14:19:50,112 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 796 transitions. Word has length 287 [2025-01-09 14:19:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:50,113 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 796 transitions. [2025-01-09 14:19:50,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:19:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 796 transitions. [2025-01-09 14:19:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 14:19:50,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:50,116 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:19:50,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 27972680, now seen corresponding path program 1 times [2025-01-09 14:19:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591486041] [2025-01-09 14:19:50,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:50,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 14:19:50,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 14:19:50,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:50,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591486041] [2025-01-09 14:19:52,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591486041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:52,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:52,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:19:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580244586] [2025-01-09 14:19:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:19:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:52,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:19:52,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:19:52,569 INFO L87 Difference]: Start difference. First operand 484 states and 796 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:19:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:55,112 INFO L93 Difference]: Finished difference Result 3066 states and 5139 transitions. [2025-01-09 14:19:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:19:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 287 [2025-01-09 14:19:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:55,124 INFO L225 Difference]: With dead ends: 3066 [2025-01-09 14:19:55,124 INFO L226 Difference]: Without dead ends: 2686 [2025-01-09 14:19:55,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:19:55,128 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 2092 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:55,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 2211 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 14:19:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-01-09 14:19:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 1345. [2025-01-09 14:19:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1098 states have (on average 1.5837887067395264) internal successors, (1739), 1100 states have internal predecessors, (1739), 235 states have call successors, (235), 11 states have call predecessors, (235), 11 states have return successors, (235), 233 states have call predecessors, (235), 235 states have call successors, (235) [2025-01-09 14:19:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2209 transitions. [2025-01-09 14:19:55,246 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2209 transitions. Word has length 287 [2025-01-09 14:19:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:55,247 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2209 transitions. [2025-01-09 14:19:55,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:19:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2209 transitions. [2025-01-09 14:19:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 14:19:55,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:55,250 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:19:55,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:55,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash 161986186, now seen corresponding path program 1 times [2025-01-09 14:19:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538459521] [2025-01-09 14:19:55,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:55,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 14:19:55,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 14:19:55,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:55,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:19:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538459521] [2025-01-09 14:19:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538459521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:19:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390735884] [2025-01-09 14:19:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:19:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:57,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:19:57,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:19:57,241 INFO L87 Difference]: Start difference. First operand 1345 states and 2209 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:19:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:59,658 INFO L93 Difference]: Finished difference Result 4552 states and 7564 transitions. [2025-01-09 14:19:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:19:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 287 [2025-01-09 14:19:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:59,675 INFO L225 Difference]: With dead ends: 4552 [2025-01-09 14:19:59,675 INFO L226 Difference]: Without dead ends: 4172 [2025-01-09 14:19:59,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:19:59,678 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2013 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2013 SdHoareTripleChecker+Valid, 2867 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:59,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2013 Valid, 2867 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:19:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-01-09 14:19:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 1929. [2025-01-09 14:19:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1592 states have (on average 1.5923366834170853) internal successors, (2535), 1594 states have internal predecessors, (2535), 321 states have call successors, (321), 15 states have call predecessors, (321), 15 states have return successors, (321), 319 states have call predecessors, (321), 321 states have call successors, (321) [2025-01-09 14:19:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3177 transitions. [2025-01-09 14:19:59,808 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3177 transitions. Word has length 287 [2025-01-09 14:19:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:59,809 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3177 transitions. [2025-01-09 14:19:59,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:19:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3177 transitions. [2025-01-09 14:19:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-09 14:19:59,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:59,811 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:19:59,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 451619402, now seen corresponding path program 1 times [2025-01-09 14:19:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124906632] [2025-01-09 14:19:59,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:59,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 14:20:00,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 14:20:00,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:00,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 3 proven. 123 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:20:00,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:00,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124906632] [2025-01-09 14:20:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124906632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:00,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630986032] [2025-01-09 14:20:00,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:00,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:00,610 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:20:00,612 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:20:00,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-09 14:20:00,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-09 14:20:00,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:00,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:00,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:20:00,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1146 proven. 102 refuted. 0 times theorem prover too weak. 2364 trivial. 0 not checked. [2025-01-09 14:20:01,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 24 proven. 102 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:20:01,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630986032] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:01,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:01,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:20:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684596754] [2025-01-09 14:20:01,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:01,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:20:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:01,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:20:01,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:20:01,397 INFO L87 Difference]: Start difference. First operand 1929 states and 3177 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 3 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-01-09 14:20:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:01,709 INFO L93 Difference]: Finished difference Result 2412 states and 3932 transitions. [2025-01-09 14:20:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:20:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 3 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) Word has length 287 [2025-01-09 14:20:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:01,717 INFO L225 Difference]: With dead ends: 2412 [2025-01-09 14:20:01,717 INFO L226 Difference]: Without dead ends: 706 [2025-01-09 14:20:01,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 571 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:20:01,724 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 367 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:01,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 473 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:20:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-01-09 14:20:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 674. [2025-01-09 14:20:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 520 states have (on average 1.476923076923077) internal successors, (768), 521 states have internal predecessors, (768), 139 states have call successors, (139), 14 states have call predecessors, (139), 14 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-01-09 14:20:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1046 transitions. [2025-01-09 14:20:01,784 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1046 transitions. Word has length 287 [2025-01-09 14:20:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:01,784 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1046 transitions. [2025-01-09 14:20:01,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 3 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-01-09 14:20:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1046 transitions. [2025-01-09 14:20:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-09 14:20:01,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:01,786 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:01,794 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:20:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:01,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1991283341, now seen corresponding path program 1 times [2025-01-09 14:20:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978296016] [2025-01-09 14:20:01,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:02,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 14:20:02,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 14:20:02,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:02,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:20:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978296016] [2025-01-09 14:20:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978296016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:20:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134249708] [2025-01-09 14:20:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:20:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:02,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:20:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:20:02,758 INFO L87 Difference]: Start difference. First operand 674 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:03,368 INFO L93 Difference]: Finished difference Result 958 states and 1488 transitions. [2025-01-09 14:20:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:20:03,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 291 [2025-01-09 14:20:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:03,373 INFO L225 Difference]: With dead ends: 958 [2025-01-09 14:20:03,373 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 14:20:03,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:20:03,374 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 277 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:03,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 929 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:20:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 14:20:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 720. [2025-01-09 14:20:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 566 states have (on average 1.4911660777385158) internal successors, (844), 567 states have internal predecessors, (844), 139 states have call successors, (139), 14 states have call predecessors, (139), 14 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-01-09 14:20:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1122 transitions. [2025-01-09 14:20:03,454 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1122 transitions. Word has length 291 [2025-01-09 14:20:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:03,457 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1122 transitions. [2025-01-09 14:20:03,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1122 transitions. [2025-01-09 14:20:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-09 14:20:03,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:03,458 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:20:03,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 961924043, now seen corresponding path program 1 times [2025-01-09 14:20:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895605974] [2025-01-09 14:20:03,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:03,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 14:20:03,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 14:20:03,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:03,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:20:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:03,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895605974] [2025-01-09 14:20:03,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895605974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:03,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:03,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401506964] [2025-01-09 14:20:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:03,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:03,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:03,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:03,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:03,649 INFO L87 Difference]: Start difference. First operand 720 states and 1122 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:03,747 INFO L93 Difference]: Finished difference Result 1070 states and 1678 transitions. [2025-01-09 14:20:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 291 [2025-01-09 14:20:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:03,751 INFO L225 Difference]: With dead ends: 1070 [2025-01-09 14:20:03,751 INFO L226 Difference]: Without dead ends: 880 [2025-01-09 14:20:03,752 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:20:03,752 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 145 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:03,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 541 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-01-09 14:20:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 878. [2025-01-09 14:20:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 678 states have (on average 1.4764011799410028) internal successors, (1001), 679 states have internal predecessors, (1001), 182 states have call successors, (182), 17 states have call predecessors, (182), 17 states have return successors, (182), 181 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:20:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1365 transitions. [2025-01-09 14:20:03,830 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1365 transitions. Word has length 291 [2025-01-09 14:20:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:03,830 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1365 transitions. [2025-01-09 14:20:03,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1365 transitions. [2025-01-09 14:20:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 14:20:03,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:03,832 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:20:03,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:03,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1302550333, now seen corresponding path program 1 times [2025-01-09 14:20:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692901887] [2025-01-09 14:20:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:03,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:20:03,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:20:03,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:03,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:20:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692901887] [2025-01-09 14:20:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692901887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:03,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:03,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458825605] [2025-01-09 14:20:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:03,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:03,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:03,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:03,998 INFO L87 Difference]: Start difference. First operand 878 states and 1365 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:04,160 INFO L93 Difference]: Finished difference Result 2182 states and 3435 transitions. [2025-01-09 14:20:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 293 [2025-01-09 14:20:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:04,170 INFO L225 Difference]: With dead ends: 2182 [2025-01-09 14:20:04,171 INFO L226 Difference]: Without dead ends: 1500 [2025-01-09 14:20:04,172 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:20:04,173 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 207 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:04,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 591 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:20:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-01-09 14:20:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1138. [2025-01-09 14:20:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 938 states have (on average 1.533049040511727) internal successors, (1438), 939 states have internal predecessors, (1438), 182 states have call successors, (182), 17 states have call predecessors, (182), 17 states have return successors, (182), 181 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:20:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1802 transitions. [2025-01-09 14:20:04,260 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1802 transitions. Word has length 293 [2025-01-09 14:20:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:04,260 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1802 transitions. [2025-01-09 14:20:04,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1802 transitions. [2025-01-09 14:20:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:20:04,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:04,262 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:20:04,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 460313498, now seen corresponding path program 1 times [2025-01-09 14:20:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931709831] [2025-01-09 14:20:04,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:04,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:20:04,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:20:04,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:04,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:20:04,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931709831] [2025-01-09 14:20:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931709831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:04,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:20:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560113219] [2025-01-09 14:20:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:04,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:20:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:20:04,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:20:04,589 INFO L87 Difference]: Start difference. First operand 1138 states and 1802 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:04,674 INFO L93 Difference]: Finished difference Result 2032 states and 3242 transitions. [2025-01-09 14:20:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:20:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 294 [2025-01-09 14:20:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:04,681 INFO L225 Difference]: With dead ends: 2032 [2025-01-09 14:20:04,682 INFO L226 Difference]: Without dead ends: 1138 [2025-01-09 14:20:04,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:20:04,684 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 92 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:04,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 592 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-01-09 14:20:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2025-01-09 14:20:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 938 states have (on average 1.5159914712153517) internal successors, (1422), 939 states have internal predecessors, (1422), 182 states have call successors, (182), 17 states have call predecessors, (182), 17 states have return successors, (182), 181 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:20:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1786 transitions. [2025-01-09 14:20:04,757 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1786 transitions. Word has length 294 [2025-01-09 14:20:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:04,758 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1786 transitions. [2025-01-09 14:20:04,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1786 transitions. [2025-01-09 14:20:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 14:20:04,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:04,761 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:20:04,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:04,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1277195239, now seen corresponding path program 1 times [2025-01-09 14:20:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446929858] [2025-01-09 14:20:04,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:04,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 14:20:04,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 14:20:04,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:04,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:20:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446929858] [2025-01-09 14:20:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446929858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:20:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635306859] [2025-01-09 14:20:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:05,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:20:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:05,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:20:05,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:20:05,148 INFO L87 Difference]: Start difference. First operand 1138 states and 1786 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:05,306 INFO L93 Difference]: Finished difference Result 3228 states and 5131 transitions. [2025-01-09 14:20:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:20:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 295 [2025-01-09 14:20:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:05,314 INFO L225 Difference]: With dead ends: 3228 [2025-01-09 14:20:05,315 INFO L226 Difference]: Without dead ends: 2350 [2025-01-09 14:20:05,316 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:20:05,317 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 219 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:05,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 674 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:20:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-01-09 14:20:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 1618. [2025-01-09 14:20:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1418 states have (on average 1.5550070521861776) internal successors, (2205), 1419 states have internal predecessors, (2205), 182 states have call successors, (182), 17 states have call predecessors, (182), 17 states have return successors, (182), 181 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 14:20:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2569 transitions. [2025-01-09 14:20:05,418 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2569 transitions. Word has length 295 [2025-01-09 14:20:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:05,418 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2569 transitions. [2025-01-09 14:20:05,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:20:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2569 transitions. [2025-01-09 14:20:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 14:20:05,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:05,420 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:20:05,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash -854493413, now seen corresponding path program 1 times [2025-01-09 14:20:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:05,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456185442] [2025-01-09 14:20:05,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:05,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:05,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 14:20:05,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 14:20:05,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:05,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:20:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456185442] [2025-01-09 14:20:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456185442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:08,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:08,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 14:20:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865396361] [2025-01-09 14:20:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:08,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:20:08,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:08,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:20:08,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:20:08,262 INFO L87 Difference]: Start difference. First operand 1618 states and 2569 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:20:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:11,488 INFO L93 Difference]: Finished difference Result 7524 states and 12164 transitions. [2025-01-09 14:20:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:20:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 295 [2025-01-09 14:20:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:11,507 INFO L225 Difference]: With dead ends: 7524 [2025-01-09 14:20:11,507 INFO L226 Difference]: Without dead ends: 6397 [2025-01-09 14:20:11,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=313, Invalid=617, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:20:11,510 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 2277 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:11,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 2568 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:20:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6397 states. [2025-01-09 14:20:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6397 to 2859. [2025-01-09 14:20:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2566 states have (on average 1.5607950116913485) internal successors, (4005), 2568 states have internal predecessors, (4005), 268 states have call successors, (268), 24 states have call predecessors, (268), 24 states have return successors, (268), 266 states have call predecessors, (268), 268 states have call successors, (268) [2025-01-09 14:20:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4541 transitions. [2025-01-09 14:20:11,684 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4541 transitions. Word has length 295 [2025-01-09 14:20:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:11,684 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 4541 transitions. [2025-01-09 14:20:11,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:20:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4541 transitions. [2025-01-09 14:20:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 14:20:11,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:11,687 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:20:11,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:11,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1446329177, now seen corresponding path program 1 times [2025-01-09 14:20:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047241623] [2025-01-09 14:20:11,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:11,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:11,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 14:20:11,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 14:20:11,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:11,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 9 proven. 117 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:20:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047241623] [2025-01-09 14:20:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047241623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990138932] [2025-01-09 14:20:12,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:12,183 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:20:12,185 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:20:12,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 14:20:12,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 14:20:12,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:12,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:12,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:20:12,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-01-09 14:20:12,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:20:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990138932] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:12,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:20:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274185409] [2025-01-09 14:20:12,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:20:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:12,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:20:12,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:20:12,881 INFO L87 Difference]: Start difference. First operand 2859 states and 4541 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-01-09 14:20:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:13,222 INFO L93 Difference]: Finished difference Result 4741 states and 7455 transitions. [2025-01-09 14:20:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:20:13,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) Word has length 295 [2025-01-09 14:20:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:13,230 INFO L225 Difference]: With dead ends: 4741 [2025-01-09 14:20:13,232 INFO L226 Difference]: Without dead ends: 2037 [2025-01-09 14:20:13,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 587 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:20:13,237 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 354 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:13,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 459 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:20:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2025-01-09 14:20:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1997. [2025-01-09 14:20:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1690 states have (on average 1.5) internal successors, (2535), 1692 states have internal predecessors, (2535), 268 states have call successors, (268), 38 states have call predecessors, (268), 38 states have return successors, (268), 266 states have call predecessors, (268), 268 states have call successors, (268) [2025-01-09 14:20:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 3071 transitions. [2025-01-09 14:20:13,369 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 3071 transitions. Word has length 295 [2025-01-09 14:20:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:13,370 INFO L471 AbstractCegarLoop]: Abstraction has 1997 states and 3071 transitions. [2025-01-09 14:20:13,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120) [2025-01-09 14:20:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 3071 transitions. [2025-01-09 14:20:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 14:20:13,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:13,372 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,380 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:20:13,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:13,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:13,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:13,577 INFO L85 PathProgramCache]: Analyzing trace with hash -849737449, now seen corresponding path program 1 times [2025-01-09 14:20:13,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:13,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158828088] [2025-01-09 14:20:13,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:13,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:13,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 14:20:13,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 14:20:13,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:20:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158828088] [2025-01-09 14:20:14,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158828088] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776446409] [2025-01-09 14:20:14,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:14,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:14,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:14,664 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:20:14,666 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:20:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 14:20:14,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 14:20:14,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:14,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 14:20:14,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2592 proven. 291 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-01-09 14:20:17,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776446409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:19,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:20:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 38] total 44 [2025-01-09 14:20:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493188968] [2025-01-09 14:20:19,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 14:20:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:19,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 14:20:19,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2789, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 14:20:19,142 INFO L87 Difference]: Start difference. First operand 1997 states and 3071 transitions. Second operand has 44 states, 43 states have (on average 4.395348837209302) internal successors, (189), 41 states have internal predecessors, (189), 12 states have call successors, (86), 8 states have call predecessors, (86), 13 states have return successors, (86), 12 states have call predecessors, (86), 12 states have call successors, (86)