./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-43.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 3f3d7c99d022d8509e68f89579042bc1fecba07028d59ece346230f0791ea7f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:46:58,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:46:58,106 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:46:58,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:46:58,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:46:58,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:46:58,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:46:58,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:46:58,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:46:58,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:46:58,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:46:58,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:46:58,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:46:58,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:46:58,133 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:46:58,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:46:58,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:46:58,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:58,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:58,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:46:58,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:46:58,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:46:58,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:46:58,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:46:58,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:46:58,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:46:58,136 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 -> 3f3d7c99d022d8509e68f89579042bc1fecba07028d59ece346230f0791ea7f9 [2025-01-09 14:46:58,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:46:58,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:46:58,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:46:58,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:46:58,416 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:46:58,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-43.i [2025-01-09 14:46:59,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9c16e6ed/15197ed2bcde4d25adb7c61b9a8480a4/FLAG8d3229e6f [2025-01-09 14:47:00,016 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:00,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-43.i [2025-01-09 14:47:00,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9c16e6ed/15197ed2bcde4d25adb7c61b9a8480a4/FLAG8d3229e6f [2025-01-09 14:47:00,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9c16e6ed/15197ed2bcde4d25adb7c61b9a8480a4 [2025-01-09 14:47:00,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:00,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:00,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:00,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:00,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:00,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:00,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00, skipping insertion in model container [2025-01-09 14:47:00,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:00,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:00,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-43.i[916,929] [2025-01-09 14:47:00,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:00,707 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:00,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-43.i[916,929] [2025-01-09 14:47:00,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:00,861 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:00,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00 WrapperNode [2025-01-09 14:47:00,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:00,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:00,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:00,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:00,873 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:47:00" (1/1) ... [2025-01-09 14:47:00,896 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:47:00" (1/1) ... [2025-01-09 14:47:01,002 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 786 [2025-01-09 14:47:01,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:01,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:01,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:01,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:01,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,081 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:47:01,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:01,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:01,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:01,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:01,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (1/1) ... [2025-01-09 14:47:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:01,255 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:47:01,261 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:47:01,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:01,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:01,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:01,437 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:01,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:02,799 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:02,800 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:02,822 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:02,822 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:02,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:02 BoogieIcfgContainer [2025-01-09 14:47:02,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:02,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:02,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:02,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:00" (1/3) ... [2025-01-09 14:47:02,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42461b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:02, skipping insertion in model container [2025-01-09 14:47:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:00" (2/3) ... [2025-01-09 14:47:02,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42461b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:02, skipping insertion in model container [2025-01-09 14:47:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:02" (3/3) ... [2025-01-09 14:47:02,832 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-43.i [2025-01-09 14:47:02,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:02,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-43.i that has 2 procedures, 323 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:02,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:02,938 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;@45056b50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:02,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 246 states have (on average 1.556910569105691) internal successors, (383), 247 states have internal predecessors, (383), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 14:47:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:47:02,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:02,976 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1816909807, now seen corresponding path program 1 times [2025-01-09 14:47:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372450008] [2025-01-09 14:47:02,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:02,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:03,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:47:03,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:47:03,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:03,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-01-09 14:47:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372450008] [2025-01-09 14:47:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372450008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763212737] [2025-01-09 14:47:03,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:03,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:03,806 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:47:03,808 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:47:04,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:47:04,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:47:04,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:04,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:04,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:04,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-01-09 14:47:04,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763212737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246917024] [2025-01-09 14:47:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:04,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:04,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:04,349 INFO L87 Difference]: Start difference. First operand has 323 states, 246 states have (on average 1.556910569105691) internal successors, (383), 247 states have internal predecessors, (383), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 14:47:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:04,409 INFO L93 Difference]: Finished difference Result 640 states and 1131 transitions. [2025-01-09 14:47:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 501 [2025-01-09 14:47:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:04,419 INFO L225 Difference]: With dead ends: 640 [2025-01-09 14:47:04,420 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 14:47:04,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 502 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:47:04,431 INFO L435 NwaCegarLoop]: 525 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, 525 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:47:04,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 14:47:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-01-09 14:47:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.5450819672131149) internal successors, (377), 244 states have internal predecessors, (377), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 14:47:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 525 transitions. [2025-01-09 14:47:04,514 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 525 transitions. Word has length 501 [2025-01-09 14:47:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:04,515 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 525 transitions. [2025-01-09 14:47:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-01-09 14:47:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 525 transitions. [2025-01-09 14:47:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:47:04,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:04,530 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,541 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:47:04,734 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:47:04,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:04,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 380844823, now seen corresponding path program 1 times [2025-01-09 14:47:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614242709] [2025-01-09 14:47:04,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:47:04,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:47:04,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:05,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614242709] [2025-01-09 14:47:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614242709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957996629] [2025-01-09 14:47:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:05,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:05,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:05,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:05,546 INFO L87 Difference]: Start difference. First operand 320 states and 525 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:05,725 INFO L93 Difference]: Finished difference Result 821 states and 1346 transitions. [2025-01-09 14:47:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 501 [2025-01-09 14:47:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:05,734 INFO L225 Difference]: With dead ends: 821 [2025-01-09 14:47:05,735 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 14:47:05,737 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:47:05,738 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 294 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:05,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1039 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 14:47:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2025-01-09 14:47:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 416 states have (on average 1.5721153846153846) internal successors, (654), 417 states have internal predecessors, (654), 82 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:47:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 818 transitions. [2025-01-09 14:47:05,801 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 818 transitions. Word has length 501 [2025-01-09 14:47:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:05,804 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 818 transitions. [2025-01-09 14:47:05,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 818 transitions. [2025-01-09 14:47:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:47:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:05,816 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:05,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:05,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1867487007, now seen corresponding path program 1 times [2025-01-09 14:47:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125528693] [2025-01-09 14:47:05,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:05,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:47:05,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:47:05,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:05,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:06,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:06,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125528693] [2025-01-09 14:47:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125528693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:06,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247226897] [2025-01-09 14:47:06,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:06,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:06,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:06,334 INFO L87 Difference]: Start difference. First operand 501 states and 818 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:06,483 INFO L93 Difference]: Finished difference Result 1494 states and 2443 transitions. [2025-01-09 14:47:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 501 [2025-01-09 14:47:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:06,496 INFO L225 Difference]: With dead ends: 1494 [2025-01-09 14:47:06,496 INFO L226 Difference]: Without dead ends: 996 [2025-01-09 14:47:06,499 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:47:06,500 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 468 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:06,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1276 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-01-09 14:47:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 990. [2025-01-09 14:47:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 821 states have (on average 1.5676004872107185) internal successors, (1287), 823 states have internal predecessors, (1287), 164 states have call successors, (164), 4 states have call predecessors, (164), 4 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 14:47:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1615 transitions. [2025-01-09 14:47:06,611 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1615 transitions. Word has length 501 [2025-01-09 14:47:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:06,613 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1615 transitions. [2025-01-09 14:47:06,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1615 transitions. [2025-01-09 14:47:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:47:06,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:06,623 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:06,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:06,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:06,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1035359775, now seen corresponding path program 1 times [2025-01-09 14:47:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968793843] [2025-01-09 14:47:06,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:06,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:47:06,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:47:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968793843] [2025-01-09 14:47:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968793843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:07,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867002317] [2025-01-09 14:47:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:07,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:07,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:07,325 INFO L87 Difference]: Start difference. First operand 990 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:07,478 INFO L93 Difference]: Finished difference Result 1983 states and 3231 transitions. [2025-01-09 14:47:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 501 [2025-01-09 14:47:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:07,486 INFO L225 Difference]: With dead ends: 1983 [2025-01-09 14:47:07,487 INFO L226 Difference]: Without dead ends: 996 [2025-01-09 14:47:07,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:07,490 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 284 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:07,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1176 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-01-09 14:47:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 994. [2025-01-09 14:47:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 824 states have (on average 1.5631067961165048) internal successors, (1288), 826 states have internal predecessors, (1288), 164 states have call successors, (164), 5 states have call predecessors, (164), 5 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 14:47:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1616 transitions. [2025-01-09 14:47:07,561 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1616 transitions. Word has length 501 [2025-01-09 14:47:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:07,562 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1616 transitions. [2025-01-09 14:47:07,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1616 transitions. [2025-01-09 14:47:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 14:47:07,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:07,572 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:07,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:07,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1966166305, now seen corresponding path program 1 times [2025-01-09 14:47:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753388067] [2025-01-09 14:47:07,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:07,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 14:47:07,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 14:47:07,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:07,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:08,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753388067] [2025-01-09 14:47:08,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753388067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:08,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469798671] [2025-01-09 14:47:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:08,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:08,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:08,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:08,228 INFO L87 Difference]: Start difference. First operand 994 states and 1616 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:08,358 INFO L93 Difference]: Finished difference Result 2170 states and 3529 transitions. [2025-01-09 14:47:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:08,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 501 [2025-01-09 14:47:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:08,366 INFO L225 Difference]: With dead ends: 2170 [2025-01-09 14:47:08,367 INFO L226 Difference]: Without dead ends: 1179 [2025-01-09 14:47:08,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:08,372 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 519 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:08,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1027 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-01-09 14:47:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 994. [2025-01-09 14:47:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 824 states have (on average 1.5533980582524272) internal successors, (1280), 826 states have internal predecessors, (1280), 164 states have call successors, (164), 5 states have call predecessors, (164), 5 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 14:47:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1608 transitions. [2025-01-09 14:47:08,451 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1608 transitions. Word has length 501 [2025-01-09 14:47:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:08,452 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1608 transitions. [2025-01-09 14:47:08,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1608 transitions. [2025-01-09 14:47:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 14:47:08,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:08,464 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:08,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:08,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:08,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1049037360, now seen corresponding path program 1 times [2025-01-09 14:47:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:08,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086741272] [2025-01-09 14:47:08,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:08,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 14:47:08,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 14:47:08,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:08,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:09,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:09,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086741272] [2025-01-09 14:47:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086741272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:09,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:09,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208024829] [2025-01-09 14:47:09,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:09,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:09,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:09,079 INFO L87 Difference]: Start difference. First operand 994 states and 1608 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:09,237 INFO L93 Difference]: Finished difference Result 2194 states and 3553 transitions. [2025-01-09 14:47:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 502 [2025-01-09 14:47:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:09,249 INFO L225 Difference]: With dead ends: 2194 [2025-01-09 14:47:09,250 INFO L226 Difference]: Without dead ends: 1203 [2025-01-09 14:47:09,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:09,253 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 532 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:09,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1780 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-01-09 14:47:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1006. [2025-01-09 14:47:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 836 states have (on average 1.5502392344497609) internal successors, (1296), 838 states have internal predecessors, (1296), 164 states have call successors, (164), 5 states have call predecessors, (164), 5 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 14:47:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1624 transitions. [2025-01-09 14:47:09,331 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1624 transitions. Word has length 502 [2025-01-09 14:47:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:09,332 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1624 transitions. [2025-01-09 14:47:09,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1624 transitions. [2025-01-09 14:47:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 14:47:09,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:09,342 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:09,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:09,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 404446549, now seen corresponding path program 1 times [2025-01-09 14:47:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:09,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021726848] [2025-01-09 14:47:09,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:09,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 14:47:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 14:47:09,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021726848] [2025-01-09 14:47:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021726848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442962018] [2025-01-09 14:47:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:10,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:10,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:10,326 INFO L87 Difference]: Start difference. First operand 1006 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:11,024 INFO L93 Difference]: Finished difference Result 3725 states and 6030 transitions. [2025-01-09 14:47:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:11,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 503 [2025-01-09 14:47:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:11,042 INFO L225 Difference]: With dead ends: 3725 [2025-01-09 14:47:11,043 INFO L226 Difference]: Without dead ends: 2722 [2025-01-09 14:47:11,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:11,046 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 1009 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:11,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1882 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-01-09 14:47:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2005. [2025-01-09 14:47:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1666 states have (on average 1.5498199279711884) internal successors, (2582), 1670 states have internal predecessors, (2582), 328 states have call successors, (328), 10 states have call predecessors, (328), 10 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-01-09 14:47:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3238 transitions. [2025-01-09 14:47:11,227 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 3238 transitions. Word has length 503 [2025-01-09 14:47:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:11,229 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 3238 transitions. [2025-01-09 14:47:11,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 3238 transitions. [2025-01-09 14:47:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 14:47:11,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:11,240 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:47:11,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:11,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash -653391529, now seen corresponding path program 1 times [2025-01-09 14:47:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18937253] [2025-01-09 14:47:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:11,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 14:47:12,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 14:47:12,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:12,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 27 proven. 192 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18937253] [2025-01-09 14:47:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18937253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:13,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863447859] [2025-01-09 14:47:13,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:13,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:13,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:13,353 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:47:13,355 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:47:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 14:47:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 14:47:13,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:13,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:13,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:47:13,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4143 proven. 54 refuted. 0 times theorem prover too weak. 6607 trivial. 0 not checked. [2025-01-09 14:47:14,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 165 proven. 54 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:15,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863447859] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:15,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-01-09 14:47:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366296071] [2025-01-09 14:47:15,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:15,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:47:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:15,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:47:15,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:47:15,774 INFO L87 Difference]: Start difference. First operand 2005 states and 3238 transitions. Second operand has 17 states, 17 states have (on average 18.176470588235293) internal successors, (309), 17 states have internal predecessors, (309), 5 states have call successors, (212), 3 states have call predecessors, (212), 6 states have return successors, (213), 5 states have call predecessors, (213), 5 states have call successors, (213) [2025-01-09 14:47:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:21,206 INFO L93 Difference]: Finished difference Result 6953 states and 11112 transitions. [2025-01-09 14:47:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 14:47:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.176470588235293) internal successors, (309), 17 states have internal predecessors, (309), 5 states have call successors, (212), 3 states have call predecessors, (212), 6 states have return successors, (213), 5 states have call predecessors, (213), 5 states have call successors, (213) Word has length 503 [2025-01-09 14:47:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:21,239 INFO L225 Difference]: With dead ends: 6953 [2025-01-09 14:47:21,239 INFO L226 Difference]: Without dead ends: 4951 [2025-01-09 14:47:21,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=839, Invalid=3853, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 14:47:21,249 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 4120 mSDsluCounter, 6360 mSDsCounter, 0 mSdLazyCounter, 4047 mSolverCounterSat, 1383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 7531 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1383 IncrementalHoareTripleChecker+Valid, 4047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:21,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 7531 Invalid, 5430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1383 Valid, 4047 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 14:47:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-01-09 14:47:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4793. [2025-01-09 14:47:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4793 states, 3542 states have (on average 1.4743083003952568) internal successors, (5222), 3547 states have internal predecessors, (5222), 1201 states have call successors, (1201), 49 states have call predecessors, (1201), 49 states have return successors, (1201), 1196 states have call predecessors, (1201), 1201 states have call successors, (1201) [2025-01-09 14:47:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 7624 transitions. [2025-01-09 14:47:21,676 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 7624 transitions. Word has length 503 [2025-01-09 14:47:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 4793 states and 7624 transitions. [2025-01-09 14:47:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.176470588235293) internal successors, (309), 17 states have internal predecessors, (309), 5 states have call successors, (212), 3 states have call predecessors, (212), 6 states have return successors, (213), 5 states have call predecessors, (213), 5 states have call successors, (213) [2025-01-09 14:47:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 7624 transitions. [2025-01-09 14:47:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 14:47:21,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:21,684 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:21,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:47:21,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:21,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1098850672, now seen corresponding path program 1 times [2025-01-09 14:47:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:21,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517942253] [2025-01-09 14:47:21,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:21,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 14:47:22,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 14:47:22,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:22,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:23,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517942253] [2025-01-09 14:47:23,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517942253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:23,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:23,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:47:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29524220] [2025-01-09 14:47:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:23,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:47:23,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:23,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:47:23,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:23,344 INFO L87 Difference]: Start difference. First operand 4793 states and 7624 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:25,079 INFO L93 Difference]: Finished difference Result 19027 states and 30071 transitions. [2025-01-09 14:47:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:47:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 504 [2025-01-09 14:47:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:25,170 INFO L225 Difference]: With dead ends: 19027 [2025-01-09 14:47:25,171 INFO L226 Difference]: Without dead ends: 14325 [2025-01-09 14:47:25,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:25,198 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 989 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:25,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 2340 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:47:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14325 states. [2025-01-09 14:47:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14325 to 11759. [2025-01-09 14:47:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11759 states, 8763 states have (on average 1.471071550838754) internal successors, (12891), 8800 states have internal predecessors, (12891), 2865 states have call successors, (2865), 130 states have call predecessors, (2865), 130 states have return successors, (2865), 2828 states have call predecessors, (2865), 2865 states have call successors, (2865) [2025-01-09 14:47:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 18621 transitions. [2025-01-09 14:47:26,373 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 18621 transitions. Word has length 504 [2025-01-09 14:47:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:26,376 INFO L471 AbstractCegarLoop]: Abstraction has 11759 states and 18621 transitions. [2025-01-09 14:47:26,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 18621 transitions. [2025-01-09 14:47:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 14:47:26,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:26,392 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:26,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:26,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:26,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:26,393 INFO L85 PathProgramCache]: Analyzing trace with hash 266723440, now seen corresponding path program 1 times [2025-01-09 14:47:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556159096] [2025-01-09 14:47:26,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:26,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 14:47:26,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 14:47:26,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:26,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:27,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556159096] [2025-01-09 14:47:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556159096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100442833] [2025-01-09 14:47:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:27,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:27,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:27,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:27,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:27,738 INFO L87 Difference]: Start difference. First operand 11759 states and 18621 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:29,837 INFO L93 Difference]: Finished difference Result 41209 states and 65196 transitions. [2025-01-09 14:47:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 504 [2025-01-09 14:47:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:29,981 INFO L225 Difference]: With dead ends: 41209 [2025-01-09 14:47:29,981 INFO L226 Difference]: Without dead ends: 29545 [2025-01-09 14:47:30,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:30,019 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 644 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:30,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2034 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29545 states. [2025-01-09 14:47:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29545 to 26925. [2025-01-09 14:47:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26925 states, 20135 states have (on average 1.4753911100074497) internal successors, (29707), 20224 states have internal predecessors, (29707), 6491 states have call successors, (6491), 298 states have call predecessors, (6491), 298 states have return successors, (6491), 6402 states have call predecessors, (6491), 6491 states have call successors, (6491) [2025-01-09 14:47:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26925 states to 26925 states and 42689 transitions. [2025-01-09 14:47:32,423 INFO L78 Accepts]: Start accepts. Automaton has 26925 states and 42689 transitions. Word has length 504 [2025-01-09 14:47:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:32,424 INFO L471 AbstractCegarLoop]: Abstraction has 26925 states and 42689 transitions. [2025-01-09 14:47:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 26925 states and 42689 transitions. [2025-01-09 14:47:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 14:47:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:32,441 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:47:32,441 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:32,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1522497394, now seen corresponding path program 1 times [2025-01-09 14:47:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:32,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217357982] [2025-01-09 14:47:32,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:32,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:32,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 14:47:32,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 14:47:32,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-01-09 14:47:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217357982] [2025-01-09 14:47:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217357982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59471664] [2025-01-09 14:47:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:32,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:32,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:32,959 INFO L87 Difference]: Start difference. First operand 26925 states and 42689 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:34,855 INFO L93 Difference]: Finished difference Result 58393 states and 92611 transitions. [2025-01-09 14:47:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:34,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 504 [2025-01-09 14:47:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:35,022 INFO L225 Difference]: With dead ends: 58393 [2025-01-09 14:47:35,023 INFO L226 Difference]: Without dead ends: 31563 [2025-01-09 14:47:35,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:35,095 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 341 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:35,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1084 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31563 states. [2025-01-09 14:47:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31563 to 31561. [2025-01-09 14:47:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31561 states, 23707 states have (on average 1.4759775593706501) internal successors, (34991), 23804 states have internal predecessors, (34991), 7507 states have call successors, (7507), 346 states have call predecessors, (7507), 346 states have return successors, (7507), 7410 states have call predecessors, (7507), 7507 states have call successors, (7507) [2025-01-09 14:47:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31561 states to 31561 states and 50005 transitions. [2025-01-09 14:47:37,429 INFO L78 Accepts]: Start accepts. Automaton has 31561 states and 50005 transitions. Word has length 504 [2025-01-09 14:47:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:37,430 INFO L471 AbstractCegarLoop]: Abstraction has 31561 states and 50005 transitions. [2025-01-09 14:47:37,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-01-09 14:47:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31561 states and 50005 transitions. [2025-01-09 14:47:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 14:47:37,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:37,444 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:47:37,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:37,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 150690096, now seen corresponding path program 1 times [2025-01-09 14:47:37,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:37,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47060873] [2025-01-09 14:47:37,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:37,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 14:47:37,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 14:47:37,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:37,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 72 proven. 147 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47060873] [2025-01-09 14:47:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47060873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206530374] [2025-01-09 14:47:38,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:38,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:38,714 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:47:38,716 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:47:38,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 14:47:39,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 14:47:39,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:39,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:39,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:39,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 5343 proven. 126 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2025-01-09 14:47:39,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 93 proven. 126 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206530374] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:40,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:40,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-01-09 14:47:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365136286] [2025-01-09 14:47:40,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:40,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:40,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:40,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:40,090 INFO L87 Difference]: Start difference. First operand 31561 states and 50005 transitions. Second operand has 10 states, 10 states have (on average 28.2) internal successors, (282), 10 states have internal predecessors, (282), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) [2025-01-09 14:47:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:43,111 INFO L93 Difference]: Finished difference Result 61569 states and 96210 transitions. [2025-01-09 14:47:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:47:43,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 28.2) internal successors, (282), 10 states have internal predecessors, (282), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) Word has length 504 [2025-01-09 14:47:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:43,255 INFO L225 Difference]: With dead ends: 61569 [2025-01-09 14:47:43,255 INFO L226 Difference]: Without dead ends: 30103 [2025-01-09 14:47:43,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:47:43,315 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 526 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:43,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1274 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:47:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30103 states. [2025-01-09 14:47:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30103 to 29457. [2025-01-09 14:47:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29457 states, 21345 states have (on average 1.4034668540641837) internal successors, (29957), 21442 states have internal predecessors, (29957), 7507 states have call successors, (7507), 604 states have call predecessors, (7507), 604 states have return successors, (7507), 7410 states have call predecessors, (7507), 7507 states have call successors, (7507) [2025-01-09 14:47:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 44971 transitions. [2025-01-09 14:47:45,265 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 44971 transitions. Word has length 504 [2025-01-09 14:47:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 29457 states and 44971 transitions. [2025-01-09 14:47:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.2) internal successors, (282), 10 states have internal predecessors, (282), 4 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) [2025-01-09 14:47:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 44971 transitions. [2025-01-09 14:47:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 14:47:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:45,277 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:45,288 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:47:45,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:45,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:45,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash 529812880, now seen corresponding path program 1 times [2025-01-09 14:47:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546943419] [2025-01-09 14:47:45,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:45,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 14:47:46,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 14:47:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 87 proven. 132 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:46,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546943419] [2025-01-09 14:47:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546943419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811429733] [2025-01-09 14:47:46,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:46,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:46,605 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:47:46,607 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:47:46,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 14:47:47,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 14:47:47,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:47,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:47,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:47,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 5235 proven. 132 refuted. 0 times theorem prover too weak. 5437 trivial. 0 not checked. [2025-01-09 14:47:47,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 87 proven. 132 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811429733] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:47,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:47:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512817767] [2025-01-09 14:47:47,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:47,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:47:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:47,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:47:47,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:47,966 INFO L87 Difference]: Start difference. First operand 29457 states and 44971 transitions. Second operand has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-01-09 14:47:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:50,403 INFO L93 Difference]: Finished difference Result 59957 states and 90805 transitions. [2025-01-09 14:47:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:47:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) Word has length 505 [2025-01-09 14:47:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:50,556 INFO L225 Difference]: With dead ends: 59957 [2025-01-09 14:47:50,557 INFO L226 Difference]: Without dead ends: 30603 [2025-01-09 14:47:50,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:47:50,652 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 592 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:50,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1024 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:47:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30603 states. [2025-01-09 14:47:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30603 to 29549. [2025-01-09 14:47:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29549 states, 21308 states have (on average 1.3906513985357611) internal successors, (29632), 21421 states have internal predecessors, (29632), 7507 states have call successors, (7507), 733 states have call predecessors, (7507), 733 states have return successors, (7507), 7394 states have call predecessors, (7507), 7507 states have call successors, (7507) [2025-01-09 14:47:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 44646 transitions. [2025-01-09 14:47:53,116 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 44646 transitions. Word has length 505 [2025-01-09 14:47:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:53,117 INFO L471 AbstractCegarLoop]: Abstraction has 29549 states and 44646 transitions. [2025-01-09 14:47:53,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 3 states have call predecessors, (163), 3 states have call successors, (163) [2025-01-09 14:47:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 44646 transitions. [2025-01-09 14:47:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 14:47:53,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:53,126 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:53,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:47:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 14:47:53,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1291279016, now seen corresponding path program 1 times [2025-01-09 14:47:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617263849] [2025-01-09 14:47:53,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:53,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 14:47:53,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 14:47:53,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:53,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 60 proven. 159 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617263849] [2025-01-09 14:47:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617263849] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982713639] [2025-01-09 14:47:54,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:54,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:54,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:54,372 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:47:54,374 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:47:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 14:47:54,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 14:47:54,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:54,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:54,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:54,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4545 proven. 63 refuted. 0 times theorem prover too weak. 6196 trivial. 0 not checked. [2025-01-09 14:47:55,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 156 proven. 63 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982713639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:55,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 14:47:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252386718] [2025-01-09 14:47:55,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:47:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:55,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:47:55,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:47:55,488 INFO L87 Difference]: Start difference. First operand 29549 states and 44646 transitions. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-01-09 14:47:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:57,026 INFO L93 Difference]: Finished difference Result 34177 states and 51487 transitions. [2025-01-09 14:47:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:47:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) Word has length 505 [2025-01-09 14:47:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:57,063 INFO L225 Difference]: With dead ends: 34177 [2025-01-09 14:47:57,063 INFO L226 Difference]: Without dead ends: 4735 [2025-01-09 14:47:57,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 1008 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:47:57,118 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 1185 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:57,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1104 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:47:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2025-01-09 14:47:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 2687. [2025-01-09 14:47:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2060 states have (on average 1.420873786407767) internal successors, (2927), 2066 states have internal predecessors, (2927), 555 states have call successors, (555), 71 states have call predecessors, (555), 71 states have return successors, (555), 549 states have call predecessors, (555), 555 states have call successors, (555) [2025-01-09 14:47:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4037 transitions. [2025-01-09 14:47:57,392 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4037 transitions. Word has length 505 [2025-01-09 14:47:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:57,393 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 4037 transitions. [2025-01-09 14:47:57,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-01-09 14:47:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4037 transitions. [2025-01-09 14:47:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-01-09 14:47:57,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:57,396 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,407 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:47:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 14:47:57,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1064612821, now seen corresponding path program 1 times [2025-01-09 14:47:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009288431] [2025-01-09 14:47:57,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:57,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-01-09 14:47:58,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-01-09 14:47:58,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 87 proven. 132 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009288431] [2025-01-09 14:47:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009288431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456774315] [2025-01-09 14:47:58,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:58,911 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:47:58,913 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:47:59,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-01-09 14:47:59,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-01-09 14:47:59,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:59,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:47:59,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 4285 proven. 57 refuted. 0 times theorem prover too weak. 6462 trivial. 0 not checked. [2025-01-09 14:47:59,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 162 proven. 57 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-01-09 14:47:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456774315] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:59,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 14:47:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590869731] [2025-01-09 14:47:59,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:59,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:59,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:59,889 INFO L87 Difference]: Start difference. First operand 2687 states and 4037 transitions. Second operand has 10 states, 10 states have (on average 21.7) internal successors, (217), 10 states have internal predecessors, (217), 3 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (139), 3 states have call predecessors, (139), 3 states have call successors, (139) [2025-01-09 14:48:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:00,913 INFO L93 Difference]: Finished difference Result 4373 states and 6507 transitions. [2025-01-09 14:48:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:48:00,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.7) internal successors, (217), 10 states have internal predecessors, (217), 3 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (139), 3 states have call predecessors, (139), 3 states have call successors, (139) Word has length 507 [2025-01-09 14:48:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:00,929 INFO L225 Difference]: With dead ends: 4373 [2025-01-09 14:48:00,929 INFO L226 Difference]: Without dead ends: 1639 [2025-01-09 14:48:00,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 1011 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:48:00,934 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1145 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:00,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1542 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:48:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-01-09 14:48:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 934. [2025-01-09 14:48:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 704 states have (on average 1.3920454545454546) internal successors, (980), 705 states have internal predecessors, (980), 199 states have call successors, (199), 30 states have call predecessors, (199), 30 states have return successors, (199), 198 states have call predecessors, (199), 199 states have call successors, (199) [2025-01-09 14:48:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1378 transitions. [2025-01-09 14:48:01,068 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1378 transitions. Word has length 507 [2025-01-09 14:48:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:01,069 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1378 transitions. [2025-01-09 14:48:01,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.7) internal successors, (217), 10 states have internal predecessors, (217), 3 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (139), 3 states have call predecessors, (139), 3 states have call successors, (139) [2025-01-09 14:48:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1378 transitions. [2025-01-09 14:48:01,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-01-09 14:48:01,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:01,072 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,084 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:48:01,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 14:48:01,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1741171667, now seen corresponding path program 1 times [2025-01-09 14:48:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:01,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198035221] [2025-01-09 14:48:01,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:01,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-01-09 14:48:02,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-01-09 14:48:02,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:48:02,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139228270] [2025-01-09 14:48:02,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:02,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:02,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:02,120 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:48:02,122 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:48:02,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes.