./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.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-53.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 7cb9b30dbc4292cb9b2a5d2ba3cd92c29fce78cf71613b08638f29c6cc332119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:25:26,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:25:26,204 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:25:26,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:25:26,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:25:26,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:25:26,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:25:26,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:25:26,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:25:26,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:25:26,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:25:26,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:25:26,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:25:26,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:25:26,238 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:25:26,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:25:26,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:25:26,238 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:25:26,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:25:26,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:25:26,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:25:26,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:26,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:26,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:26,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:26,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:26,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:25:26,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:25:26,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:25:26,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:25:26,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:25:26,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:25:26,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:25:26,242 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 -> 7cb9b30dbc4292cb9b2a5d2ba3cd92c29fce78cf71613b08638f29c6cc332119 [2025-01-09 14:25:26,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:25:26,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:25:26,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:25:26,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:25:26,533 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:25:26,534 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-53.i [2025-01-09 14:25:27,810 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba6866568/a0adfa483d5e498a9f7af4eac2a240ae/FLAG32078c919 [2025-01-09 14:25:28,097 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:25:28,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-53.i [2025-01-09 14:25:28,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba6866568/a0adfa483d5e498a9f7af4eac2a240ae/FLAG32078c919 [2025-01-09 14:25:28,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba6866568/a0adfa483d5e498a9f7af4eac2a240ae [2025-01-09 14:25:28,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:25:28,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:25:28,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:28,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:25:28,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:25:28,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db9e090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28, skipping insertion in model container [2025-01-09 14:25:28,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:25:28,306 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-53.i[916,929] [2025-01-09 14:25:28,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:28,504 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:25:28,514 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-53.i[916,929] [2025-01-09 14:25:28,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:28,615 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:25:28,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28 WrapperNode [2025-01-09 14:25:28,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:28,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:28,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:25:28,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:25:28,624 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:25:28" (1/1) ... [2025-01-09 14:25:28,639 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:25:28" (1/1) ... [2025-01-09 14:25:28,711 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-01-09 14:25:28,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:28,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:25:28,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:25:28,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:25:28,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,769 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:25:28,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:25:28,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:25:28,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:25:28,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:25:28,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (1/1) ... [2025-01-09 14:25:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:28,879 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:25:28,885 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:25:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:25:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:25:28,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:25:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:25:28,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:25:28,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:25:29,004 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:25:29,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:25:29,783 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-01-09 14:25:29,783 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:25:29,795 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:25:29,795 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:25:29,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:29 BoogieIcfgContainer [2025-01-09 14:25:29,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:25:29,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:25:29,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:25:29,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:25:29,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:25:28" (1/3) ... [2025-01-09 14:25:29,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2561f0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:29, skipping insertion in model container [2025-01-09 14:25:29,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:28" (2/3) ... [2025-01-09 14:25:29,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2561f0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:29, skipping insertion in model container [2025-01-09 14:25:29,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:29" (3/3) ... [2025-01-09 14:25:29,803 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-53.i [2025-01-09 14:25:29,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:25:29,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-53.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:25:29,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:25:29,879 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;@148eb50e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:25:29,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:25:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 120 states have (on average 1.475) internal successors, (177), 121 states have internal predecessors, (177), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:25:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:29,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:29,899 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:29,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:29,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1029379387, now seen corresponding path program 1 times [2025-01-09 14:25:29,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:29,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590387743] [2025-01-09 14:25:29,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:30,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:30,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:30,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:30,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-01-09 14:25:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:30,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590387743] [2025-01-09 14:25:30,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590387743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506586794] [2025-01-09 14:25:30,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:30,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:30,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:30,486 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:25:30,488 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:25:30,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:30,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:30,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:30,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:30,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:25:30,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-01-09 14:25:30,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:25:30,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506586794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:30,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:25:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:25:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810218085] [2025-01-09 14:25:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:30,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:25:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:30,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:25:30,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:25:30,902 INFO L87 Difference]: Start difference. First operand has 168 states, 120 states have (on average 1.475) internal successors, (177), 121 states have internal predecessors, (177), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:25:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:30,941 INFO L93 Difference]: Finished difference Result 328 states and 570 transitions. [2025-01-09 14:25:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:25:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 305 [2025-01-09 14:25:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:30,950 INFO L225 Difference]: With dead ends: 328 [2025-01-09 14:25:30,950 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 14:25:30,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 306 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:25:30,957 INFO L435 NwaCegarLoop]: 257 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, 257 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:25:30,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:25:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 14:25:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-01-09 14:25:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:25:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2025-01-09 14:25:31,023 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 305 [2025-01-09 14:25:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2025-01-09 14:25:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:25:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2025-01-09 14:25:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:31,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:31,036 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:31,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:25:31,236 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:25:31,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:31,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash 412902983, now seen corresponding path program 1 times [2025-01-09 14:25:31,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:31,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707590453] [2025-01-09 14:25:31,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:31,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:31,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:31,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:31,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707590453] [2025-01-09 14:25:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707590453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:31,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:25:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819234556] [2025-01-09 14:25:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:31,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:25:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:31,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:25:31,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:25:31,621 INFO L87 Difference]: Start difference. First operand 163 states and 257 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:31,733 INFO L93 Difference]: Finished difference Result 472 states and 745 transitions. [2025-01-09 14:25:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:25:31,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-01-09 14:25:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:31,741 INFO L225 Difference]: With dead ends: 472 [2025-01-09 14:25:31,741 INFO L226 Difference]: Without dead ends: 312 [2025-01-09 14:25:31,743 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:25:31,743 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 233 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:31,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 704 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:25:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-09 14:25:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 182. [2025-01-09 14:25:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 135 states have (on average 1.451851851851852) internal successors, (196), 135 states have internal predecessors, (196), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:25:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 286 transitions. [2025-01-09 14:25:31,784 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 286 transitions. Word has length 305 [2025-01-09 14:25:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 286 transitions. [2025-01-09 14:25:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2025-01-09 14:25:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:31,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:31,795 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:31,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:25:31,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1419609467, now seen corresponding path program 1 times [2025-01-09 14:25:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487148153] [2025-01-09 14:25:31,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:31,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:31,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:31,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487148153] [2025-01-09 14:25:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487148153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234497819] [2025-01-09 14:25:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:32,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:32,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:32,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:32,371 INFO L87 Difference]: Start difference. First operand 182 states and 286 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:32,615 INFO L93 Difference]: Finished difference Result 540 states and 852 transitions. [2025-01-09 14:25:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:32,618 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-01-09 14:25:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:32,622 INFO L225 Difference]: With dead ends: 540 [2025-01-09 14:25:32,622 INFO L226 Difference]: Without dead ends: 361 [2025-01-09 14:25:32,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:32,625 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 140 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:32,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 669 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:25:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-09 14:25:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2025-01-09 14:25:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 266 states have (on average 1.4511278195488722) internal successors, (386), 266 states have internal predecessors, (386), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:25:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2025-01-09 14:25:32,692 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 305 [2025-01-09 14:25:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:32,694 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2025-01-09 14:25:32,694 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2025-01-09 14:25:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:32,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:32,698 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:32,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:25:32,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:32,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -718544889, now seen corresponding path program 1 times [2025-01-09 14:25:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269329432] [2025-01-09 14:25:32,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:32,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:32,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:32,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:32,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269329432] [2025-01-09 14:25:33,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269329432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:33,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:33,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085324755] [2025-01-09 14:25:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:33,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:33,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:33,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:33,424 INFO L87 Difference]: Start difference. First operand 359 states and 566 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:33,909 INFO L93 Difference]: Finished difference Result 1131 states and 1778 transitions. [2025-01-09 14:25:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:33,910 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-01-09 14:25:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:33,921 INFO L225 Difference]: With dead ends: 1131 [2025-01-09 14:25:33,922 INFO L226 Difference]: Without dead ends: 775 [2025-01-09 14:25:33,924 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:25:33,924 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 286 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:33,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 793 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-01-09 14:25:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 691. [2025-01-09 14:25:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 506 states have (on average 1.4367588932806323) internal successors, (727), 506 states have internal predecessors, (727), 180 states have call successors, (180), 4 states have call predecessors, (180), 4 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:25:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1087 transitions. [2025-01-09 14:25:34,043 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1087 transitions. Word has length 305 [2025-01-09 14:25:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:34,045 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1087 transitions. [2025-01-09 14:25:34,045 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, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1087 transitions. [2025-01-09 14:25:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:34,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:34,051 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:34,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:25:34,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -294898167, now seen corresponding path program 1 times [2025-01-09 14:25:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490407212] [2025-01-09 14:25:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:34,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:35,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:35,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:35,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490407212] [2025-01-09 14:25:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490407212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200040956] [2025-01-09 14:25:35,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:35,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:35,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:35,532 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:25:35,535 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:25:35,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:35,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:35,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:35,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:35,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:25:35,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1518 proven. 99 refuted. 0 times theorem prover too weak. 2343 trivial. 0 not checked. [2025-01-09 14:25:36,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 33 proven. 99 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200040956] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:36,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-01-09 14:25:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129878142] [2025-01-09 14:25:36,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:25:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:36,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:25:36,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:25:36,883 INFO L87 Difference]: Start difference. First operand 691 states and 1087 transitions. Second operand has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 5 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 5 states have call predecessors, (124), 5 states have call successors, (124) [2025-01-09 14:25:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:37,833 INFO L93 Difference]: Finished difference Result 1723 states and 2653 transitions. [2025-01-09 14:25:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:25:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 5 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 5 states have call predecessors, (124), 5 states have call successors, (124) Word has length 305 [2025-01-09 14:25:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:37,845 INFO L225 Difference]: With dead ends: 1723 [2025-01-09 14:25:37,846 INFO L226 Difference]: Without dead ends: 1035 [2025-01-09 14:25:37,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:25:37,851 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 853 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:37,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 572 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:25:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-01-09 14:25:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 743. [2025-01-09 14:25:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 546 states have (on average 1.3974358974358974) internal successors, (763), 546 states have internal predecessors, (763), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:25:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1123 transitions. [2025-01-09 14:25:37,981 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1123 transitions. Word has length 305 [2025-01-09 14:25:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:37,982 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1123 transitions. [2025-01-09 14:25:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 5 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 5 states have call predecessors, (124), 5 states have call successors, (124) [2025-01-09 14:25:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1123 transitions. [2025-01-09 14:25:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:37,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:37,987 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:38,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:38,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1750836749, now seen corresponding path program 1 times [2025-01-09 14:25:38,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:38,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652081253] [2025-01-09 14:25:38,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:38,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:38,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:38,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652081253] [2025-01-09 14:25:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652081253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983728348] [2025-01-09 14:25:38,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:38,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:38,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:38,966 INFO L87 Difference]: Start difference. First operand 743 states and 1123 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:39,387 INFO L93 Difference]: Finished difference Result 1802 states and 2721 transitions. [2025-01-09 14:25:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-01-09 14:25:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:39,396 INFO L225 Difference]: With dead ends: 1802 [2025-01-09 14:25:39,396 INFO L226 Difference]: Without dead ends: 1062 [2025-01-09 14:25:39,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:25:39,400 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 301 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:39,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 910 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-01-09 14:25:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 855. [2025-01-09 14:25:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 608 states have (on average 1.3717105263157894) internal successors, (834), 608 states have internal predecessors, (834), 225 states have call successors, (225), 21 states have call predecessors, (225), 21 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1284 transitions. [2025-01-09 14:25:39,476 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1284 transitions. Word has length 305 [2025-01-09 14:25:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:39,476 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1284 transitions. [2025-01-09 14:25:39,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1284 transitions. [2025-01-09 14:25:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:39,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:39,480 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:39,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:25:39,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1356469963, now seen corresponding path program 1 times [2025-01-09 14:25:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:39,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455663769] [2025-01-09 14:25:39,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:39,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:39,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455663769] [2025-01-09 14:25:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455663769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:25:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156565506] [2025-01-09 14:25:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:40,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:25:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:40,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:25:40,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:40,515 INFO L87 Difference]: Start difference. First operand 855 states and 1284 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:41,264 INFO L93 Difference]: Finished difference Result 1729 states and 2603 transitions. [2025-01-09 14:25:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:25:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-01-09 14:25:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:41,274 INFO L225 Difference]: With dead ends: 1729 [2025-01-09 14:25:41,274 INFO L226 Difference]: Without dead ends: 989 [2025-01-09 14:25:41,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:25:41,277 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 459 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:41,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1166 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:25:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-01-09 14:25:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 832. [2025-01-09 14:25:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 583 states have (on average 1.353344768439108) internal successors, (789), 583 states have internal predecessors, (789), 225 states have call successors, (225), 23 states have call predecessors, (225), 23 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1239 transitions. [2025-01-09 14:25:41,383 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1239 transitions. Word has length 305 [2025-01-09 14:25:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:41,384 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1239 transitions. [2025-01-09 14:25:41,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1239 transitions. [2025-01-09 14:25:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:41,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:41,390 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:25:41,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:41,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 436550667, now seen corresponding path program 1 times [2025-01-09 14:25:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:41,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573008540] [2025-01-09 14:25:41,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:41,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:41,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:41,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:41,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573008540] [2025-01-09 14:25:41,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573008540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:41,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:41,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:41,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140594394] [2025-01-09 14:25:41,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:41,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:41,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:41,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:41,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:41,674 INFO L87 Difference]: Start difference. First operand 832 states and 1239 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:42,126 INFO L93 Difference]: Finished difference Result 1463 states and 2180 transitions. [2025-01-09 14:25:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 305 [2025-01-09 14:25:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:42,137 INFO L225 Difference]: With dead ends: 1463 [2025-01-09 14:25:42,138 INFO L226 Difference]: Without dead ends: 1092 [2025-01-09 14:25:42,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:42,140 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 179 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:42,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1291 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-01-09 14:25:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 838. [2025-01-09 14:25:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 589 states have (on average 1.3497453310696095) internal successors, (795), 589 states have internal predecessors, (795), 225 states have call successors, (225), 23 states have call predecessors, (225), 23 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1245 transitions. [2025-01-09 14:25:42,249 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1245 transitions. Word has length 305 [2025-01-09 14:25:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:42,250 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1245 transitions. [2025-01-09 14:25:42,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1245 transitions. [2025-01-09 14:25:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 14:25:42,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:42,255 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:25:42,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1137615245, now seen corresponding path program 1 times [2025-01-09 14:25:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214777350] [2025-01-09 14:25:42,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:42,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:42,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214777350] [2025-01-09 14:25:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214777350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796704941] [2025-01-09 14:25:43,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:43,131 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:25:43,133 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:25:43,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 14:25:43,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 14:25:43,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:43,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:43,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:25:43,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1892 proven. 48 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2025-01-09 14:25:43,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 84 proven. 48 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796704941] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:43,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:43,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 14:25:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351416260] [2025-01-09 14:25:43,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:43,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:25:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:43,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:25:43,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:25:43,869 INFO L87 Difference]: Start difference. First operand 838 states and 1245 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2025-01-09 14:25:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:44,589 INFO L93 Difference]: Finished difference Result 1631 states and 2393 transitions. [2025-01-09 14:25:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:25:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) Word has length 305 [2025-01-09 14:25:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:44,598 INFO L225 Difference]: With dead ends: 1631 [2025-01-09 14:25:44,598 INFO L226 Difference]: Without dead ends: 894 [2025-01-09 14:25:44,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:25:44,603 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 427 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:44,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 456 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-09 14:25:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 874. [2025-01-09 14:25:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 615 states have (on average 1.305691056910569) internal successors, (803), 615 states have internal predecessors, (803), 225 states have call successors, (225), 33 states have call predecessors, (225), 33 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1253 transitions. [2025-01-09 14:25:44,701 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1253 transitions. Word has length 305 [2025-01-09 14:25:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:44,701 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1253 transitions. [2025-01-09 14:25:44,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 4 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2025-01-09 14:25:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1253 transitions. [2025-01-09 14:25:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 14:25:44,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:44,706 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:44,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:44,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:44,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1281966370, now seen corresponding path program 1 times [2025-01-09 14:25:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134207009] [2025-01-09 14:25:44,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:44,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 14:25:44,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 14:25:44,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:44,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:25:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134207009] [2025-01-09 14:25:45,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134207009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:45,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190410163] [2025-01-09 14:25:45,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:45,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:45,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:45,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:45,258 INFO L87 Difference]: Start difference. First operand 874 states and 1253 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:45,659 INFO L93 Difference]: Finished difference Result 1766 states and 2544 transitions. [2025-01-09 14:25:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:45,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 307 [2025-01-09 14:25:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:45,669 INFO L225 Difference]: With dead ends: 1766 [2025-01-09 14:25:45,669 INFO L226 Difference]: Without dead ends: 1001 [2025-01-09 14:25:45,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:25:45,672 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 275 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:45,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 967 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-01-09 14:25:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 874. [2025-01-09 14:25:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 615 states have (on average 1.3008130081300813) internal successors, (800), 615 states have internal predecessors, (800), 225 states have call successors, (225), 33 states have call predecessors, (225), 33 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1250 transitions. [2025-01-09 14:25:45,768 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1250 transitions. Word has length 307 [2025-01-09 14:25:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1250 transitions. [2025-01-09 14:25:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:25:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1250 transitions. [2025-01-09 14:25:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 14:25:45,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:45,774 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:45,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:25:45,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:45,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash 928877988, now seen corresponding path program 1 times [2025-01-09 14:25:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567565332] [2025-01-09 14:25:45,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:45,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:45,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 14:25:46,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 14:25:46,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:46,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567565332] [2025-01-09 14:25:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567565332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686826849] [2025-01-09 14:25:46,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:46,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:46,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:46,625 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:25:46,628 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:25:46,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 14:25:46,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 14:25:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:46,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 14:25:46,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2223 proven. 141 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2025-01-09 14:25:47,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 168 proven. 93 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-01-09 14:25:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686826849] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:48,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 9] total 20 [2025-01-09 14:25:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847517831] [2025-01-09 14:25:48,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:25:48,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:48,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:25:48,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:25:48,672 INFO L87 Difference]: Start difference. First operand 874 states and 1250 transitions. Second operand has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 6 states have call successors, (83), 4 states have call predecessors, (83), 9 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-01-09 14:25:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:51,160 INFO L93 Difference]: Finished difference Result 2743 states and 3793 transitions. [2025-01-09 14:25:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 14:25:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 6 states have call successors, (83), 4 states have call predecessors, (83), 9 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) Word has length 307 [2025-01-09 14:25:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:51,174 INFO L225 Difference]: With dead ends: 2743 [2025-01-09 14:25:51,174 INFO L226 Difference]: Without dead ends: 1992 [2025-01-09 14:25:51,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 607 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1135, Invalid=3557, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 14:25:51,181 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 919 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:51,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1673 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:25:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-01-09 14:25:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 962. [2025-01-09 14:25:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 683 states have (on average 1.2313323572474377) internal successors, (841), 683 states have internal predecessors, (841), 225 states have call successors, (225), 53 states have call predecessors, (225), 53 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1291 transitions. [2025-01-09 14:25:51,322 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1291 transitions. Word has length 307 [2025-01-09 14:25:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:51,322 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1291 transitions. [2025-01-09 14:25:51,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 6 states have call successors, (83), 4 states have call predecessors, (83), 9 states have return successors, (84), 6 states have call predecessors, (84), 6 states have call successors, (84) [2025-01-09 14:25:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1291 transitions. [2025-01-09 14:25:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-01-09 14:25:51,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:51,326 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:51,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:51,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 14:25:51,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:51,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2009607777, now seen corresponding path program 1 times [2025-01-09 14:25:51,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:51,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304021000] [2025-01-09 14:25:51,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:51,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 14:25:51,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 14:25:51,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:51,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304021000] [2025-01-09 14:25:52,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304021000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302767595] [2025-01-09 14:25:52,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:52,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:52,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:52,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:25:52,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 14:25:52,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 14:25:52,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:52,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:52,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:25:52,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1934 proven. 51 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2025-01-09 14:25:53,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:25:53,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302767595] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:53,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:53,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2025-01-09 14:25:53,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493896289] [2025-01-09 14:25:53,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:53,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:25:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:53,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:25:53,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:25:53,452 INFO L87 Difference]: Start difference. First operand 962 states and 1291 transitions. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) [2025-01-09 14:25:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:54,449 INFO L93 Difference]: Finished difference Result 1949 states and 2603 transitions. [2025-01-09 14:25:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 14:25:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) Word has length 309 [2025-01-09 14:25:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:54,457 INFO L225 Difference]: With dead ends: 1949 [2025-01-09 14:25:54,457 INFO L226 Difference]: Without dead ends: 1119 [2025-01-09 14:25:54,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:25:54,461 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 406 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:54,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1515 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:25:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-01-09 14:25:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 913. [2025-01-09 14:25:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 634 states have (on average 1.2003154574132493) internal successors, (761), 634 states have internal predecessors, (761), 225 states have call successors, (225), 53 states have call predecessors, (225), 53 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 14:25:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1211 transitions. [2025-01-09 14:25:54,597 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1211 transitions. Word has length 309 [2025-01-09 14:25:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:54,599 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1211 transitions. [2025-01-09 14:25:54,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (107), 3 states have call predecessors, (107), 6 states have return successors, (108), 5 states have call predecessors, (108), 5 states have call successors, (108) [2025-01-09 14:25:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1211 transitions. [2025-01-09 14:25:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-09 14:25:54,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:54,601 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:25:54,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 14:25:54,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:54,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash 890435919, now seen corresponding path program 1 times [2025-01-09 14:25:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246332747] [2025-01-09 14:25:54,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:54,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:25:55,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:25:55,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:55,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 51 proven. 207 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2025-01-09 14:25:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246332747] [2025-01-09 14:25:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246332747] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236251006] [2025-01-09 14:25:56,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:56,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:56,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:25:56,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:25:56,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:25:56,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:56,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:56,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 14:25:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2038 proven. 318 refuted. 0 times theorem prover too weak. 1604 trivial. 0 not checked. [2025-01-09 14:25:57,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 12 proven. 249 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-01-09 14:25:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236251006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:59,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 34 [2025-01-09 14:25:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969806052] [2025-01-09 14:25:59,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 14:25:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:59,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 14:25:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:25:59,135 INFO L87 Difference]: Start difference. First operand 913 states and 1211 transitions. Second operand has 34 states, 34 states have (on average 7.147058823529412) internal successors, (243), 34 states have internal predecessors, (243), 10 states have call successors, (134), 4 states have call predecessors, (134), 9 states have return successors, (135), 8 states have call predecessors, (135), 10 states have call successors, (135) [2025-01-09 14:26:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:03,018 INFO L93 Difference]: Finished difference Result 2993 states and 3926 transitions. [2025-01-09 14:26:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 14:26:03,019 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.147058823529412) internal successors, (243), 34 states have internal predecessors, (243), 10 states have call successors, (134), 4 states have call predecessors, (134), 9 states have return successors, (135), 8 states have call predecessors, (135), 10 states have call successors, (135) Word has length 310 [2025-01-09 14:26:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:03,032 INFO L225 Difference]: With dead ends: 2993 [2025-01-09 14:26:03,032 INFO L226 Difference]: Without dead ends: 2219 [2025-01-09 14:26:03,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1582, Invalid=6074, Unknown=0, NotChecked=0, Total=7656 [2025-01-09 14:26:03,039 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 2513 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:03,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 1620 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:26:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2025-01-09 14:26:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 1257. [2025-01-09 14:26:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 928 states have (on average 1.2122844827586208) internal successors, (1125), 932 states have internal predecessors, (1125), 249 states have call successors, (249), 79 states have call predecessors, (249), 79 states have return successors, (249), 245 states have call predecessors, (249), 249 states have call successors, (249) [2025-01-09 14:26:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1623 transitions. [2025-01-09 14:26:03,405 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1623 transitions. Word has length 310 [2025-01-09 14:26:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1623 transitions. [2025-01-09 14:26:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.147058823529412) internal successors, (243), 34 states have internal predecessors, (243), 10 states have call successors, (134), 4 states have call predecessors, (134), 9 states have return successors, (135), 8 states have call predecessors, (135), 10 states have call successors, (135) [2025-01-09 14:26:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1623 transitions. [2025-01-09 14:26:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-09 14:26:03,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:03,409 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:03,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:03,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 14:26:03,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:03,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -348482677, now seen corresponding path program 1 times [2025-01-09 14:26:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896657180] [2025-01-09 14:26:03,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:03,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:26:03,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:26:03,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:03,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:26:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896657180] [2025-01-09 14:26:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896657180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:26:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189749856] [2025-01-09 14:26:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:08,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:26:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:08,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:26:08,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:26:08,401 INFO L87 Difference]: Start difference. First operand 1257 states and 1623 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-01-09 14:26:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:11,051 INFO L93 Difference]: Finished difference Result 5474 states and 7062 transitions. [2025-01-09 14:26:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:26:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 310 [2025-01-09 14:26:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:11,077 INFO L225 Difference]: With dead ends: 5474 [2025-01-09 14:26:11,078 INFO L226 Difference]: Without dead ends: 4364 [2025-01-09 14:26:11,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:26:11,083 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 974 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:11,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1409 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:26:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2025-01-09 14:26:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 2352. [2025-01-09 14:26:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 1788 states have (on average 1.2304250559284116) internal successors, (2200), 1792 states have internal predecessors, (2200), 429 states have call successors, (429), 134 states have call predecessors, (429), 134 states have return successors, (429), 425 states have call predecessors, (429), 429 states have call successors, (429) [2025-01-09 14:26:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3058 transitions. [2025-01-09 14:26:11,509 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3058 transitions. Word has length 310 [2025-01-09 14:26:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:11,510 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3058 transitions. [2025-01-09 14:26:11,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-01-09 14:26:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3058 transitions. [2025-01-09 14:26:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-09 14:26:11,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:11,513 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:11,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:26:11,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:11,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1936830579, now seen corresponding path program 1 times [2025-01-09 14:26:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:11,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107911142] [2025-01-09 14:26:11,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:11,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:26:11,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:26:11,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:11,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 27 proven. 105 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:26:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107911142] [2025-01-09 14:26:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107911142] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006784506] [2025-01-09 14:26:13,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:13,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:13,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:13,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:26:13,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:26:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:26:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:13,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:26:13,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1359 proven. 204 refuted. 0 times theorem prover too weak. 2397 trivial. 0 not checked. [2025-01-09 14:26:14,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 207 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-01-09 14:26:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006784506] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:15,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-01-09 14:26:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030371056] [2025-01-09 14:26:15,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:26:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:15,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:26:15,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:26:15,646 INFO L87 Difference]: Start difference. First operand 2352 states and 3058 transitions. Second operand has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 26 states have internal predecessors, (239), 9 states have call successors, (135), 4 states have call predecessors, (135), 8 states have return successors, (135), 9 states have call predecessors, (135), 9 states have call successors, (135) [2025-01-09 14:26:21,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:26:25,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:26:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:27,640 INFO L93 Difference]: Finished difference Result 7672 states and 9949 transitions. [2025-01-09 14:26:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 14:26:27,641 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 26 states have internal predecessors, (239), 9 states have call successors, (135), 4 states have call predecessors, (135), 8 states have return successors, (135), 9 states have call predecessors, (135), 9 states have call successors, (135) Word has length 310 [2025-01-09 14:26:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:27,667 INFO L225 Difference]: With dead ends: 7672 [2025-01-09 14:26:27,667 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 14:26:27,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=625, Invalid=2027, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 14:26:27,674 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1441 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 2851 mSolverCounterSat, 331 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2851 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:27,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 2947 Invalid, 3184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2851 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2025-01-09 14:26:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 14:26:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 4092. [2025-01-09 14:26:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 3156 states have (on average 1.2281368821292775) internal successors, (3876), 3172 states have internal predecessors, (3876), 693 states have call successors, (693), 242 states have call predecessors, (693), 242 states have return successors, (693), 677 states have call predecessors, (693), 693 states have call successors, (693) [2025-01-09 14:26:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 5262 transitions. [2025-01-09 14:26:28,374 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 5262 transitions. Word has length 310 [2025-01-09 14:26:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 4092 states and 5262 transitions. [2025-01-09 14:26:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 26 states have internal predecessors, (239), 9 states have call successors, (135), 4 states have call predecessors, (135), 8 states have return successors, (135), 9 states have call predecessors, (135), 9 states have call successors, (135) [2025-01-09 14:26:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 5262 transitions. [2025-01-09 14:26:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-09 14:26:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:28,378 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:28,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:28,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:28,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1514128753, now seen corresponding path program 1 times [2025-01-09 14:26:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:28,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823115489] [2025-01-09 14:26:28,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:28,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:26:28,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:26:28,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:28,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 12 proven. 246 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2025-01-09 14:26:30,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823115489] [2025-01-09 14:26:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823115489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785270324] [2025-01-09 14:26:30,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:30,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:30,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:30,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 14:26:30,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 14:26:30,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 14:26:30,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:30,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:30,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 14:26:30,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2163 proven. 444 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-01-09 14:26:36,328 INFO L312 TraceCheckSpWp]: Computing backward predicates...