./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/parity.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/bitvector/parity.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 d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:01,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:01,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:48:01,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:01,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:01,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:01,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:01,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:01,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:01,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:01,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:01,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:01,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:01,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:01,173 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:01,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:01,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:01,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:01,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:01,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:01,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:01,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:01,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:01,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:01,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:01,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:01,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:01,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:01,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:01,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:01,176 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 -> d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3 [2025-01-08 22:48:01,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:01,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:01,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:01,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:01,390 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:01,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/parity.i [2025-01-08 22:48:02,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaef29ada/46d2fc428d51480ba87f48d16bef4506/FLAG37451f9b1 [2025-01-08 22:48:02,799 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:02,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i [2025-01-08 22:48:02,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaef29ada/46d2fc428d51480ba87f48d16bef4506/FLAG37451f9b1 [2025-01-08 22:48:03,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaef29ada/46d2fc428d51480ba87f48d16bef4506 [2025-01-08 22:48:03,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:03,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:03,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:03,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:03,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:03,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03, skipping insertion in model container [2025-01-08 22:48:03,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:03,250 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/bitvector/parity.i[1162,1175] [2025-01-08 22:48:03,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:03,268 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:03,276 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/bitvector/parity.i[1162,1175] [2025-01-08 22:48:03,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:03,293 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:03,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03 WrapperNode [2025-01-08 22:48:03,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:03,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:03,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:03,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:03,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,317 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-01-08 22:48:03,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:03,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:03,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:03,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:03,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,340 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-08 22:48:03,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:03,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:03,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:03,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:03,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (1/1) ... [2025-01-08 22:48:03,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:03,375 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-08 22:48:03,385 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-08 22:48:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:48:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:03,456 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:03,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:03,561 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:03,561 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:03,567 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:03,567 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:48:03,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:03 BoogieIcfgContainer [2025-01-08 22:48:03,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:03,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:03,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:03,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:03,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:03" (1/3) ... [2025-01-08 22:48:03,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594c6669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:03, skipping insertion in model container [2025-01-08 22:48:03,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:03" (2/3) ... [2025-01-08 22:48:03,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594c6669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:03, skipping insertion in model container [2025-01-08 22:48:03,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:03" (3/3) ... [2025-01-08 22:48:03,573 INFO L128 eAbstractionObserver]: Analyzing ICFG parity.i [2025-01-08 22:48:03,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:03,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parity.i that has 1 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:48:03,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:03,618 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;@16b720a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:03,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:48:03,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:03,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:03,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1238931972, now seen corresponding path program 1 times [2025-01-08 22:48:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918069150] [2025-01-08 22:48:03,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:03,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:48:03,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:48:03,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:03,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918069150] [2025-01-08 22:48:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918069150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928169170] [2025-01-08 22:48:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:03,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:03,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:03,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:03,940 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:04,001 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2025-01-08 22:48:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:48:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:04,008 INFO L225 Difference]: With dead ends: 62 [2025-01-08 22:48:04,008 INFO L226 Difference]: Without dead ends: 29 [2025-01-08 22:48:04,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,013 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:04,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-08 22:48:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-08 22:48:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2025-01-08 22:48:04,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 13 [2025-01-08 22:48:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:04,032 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-01-08 22:48:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2025-01-08 22:48:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:48:04,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:04,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:48:04,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:04,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1238872390, now seen corresponding path program 1 times [2025-01-08 22:48:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138981866] [2025-01-08 22:48:04,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:04,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:48:04,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:48:04,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:04,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138981866] [2025-01-08 22:48:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138981866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:04,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:04,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:04,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320094564] [2025-01-08 22:48:04,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:04,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:04,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:04,162 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:04,210 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2025-01-08 22:48:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:48:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:04,212 INFO L225 Difference]: With dead ends: 82 [2025-01-08 22:48:04,213 INFO L226 Difference]: Without dead ends: 51 [2025-01-08 22:48:04,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:04,213 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:04,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-08 22:48:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-01-08 22:48:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-01-08 22:48:04,221 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 13 [2025-01-08 22:48:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:04,221 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-01-08 22:48:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2025-01-08 22:48:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:48:04,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:04,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:04,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:48:04,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:04,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1379367031, now seen corresponding path program 1 times [2025-01-08 22:48:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953814106] [2025-01-08 22:48:04,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:04,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:48:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:48:04,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:04,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953814106] [2025-01-08 22:48:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953814106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:04,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419995734] [2025-01-08 22:48:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:04,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:04,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,336 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:04,372 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2025-01-08 22:48:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:04,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-08 22:48:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:04,373 INFO L225 Difference]: With dead ends: 66 [2025-01-08 22:48:04,373 INFO L226 Difference]: Without dead ends: 52 [2025-01-08 22:48:04,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,374 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:04,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-08 22:48:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-08 22:48:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-01-08 22:48:04,381 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 14 [2025-01-08 22:48:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:04,381 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-01-08 22:48:04,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2025-01-08 22:48:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-08 22:48:04,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:04,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:04,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:48:04,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1672866808, now seen corresponding path program 1 times [2025-01-08 22:48:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189662162] [2025-01-08 22:48:04,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:04,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-08 22:48:04,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-08 22:48:04,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:04,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189662162] [2025-01-08 22:48:04,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189662162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:04,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970377672] [2025-01-08 22:48:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:04,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:04,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,470 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:04,503 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2025-01-08 22:48:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:04,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-08 22:48:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:04,504 INFO L225 Difference]: With dead ends: 82 [2025-01-08 22:48:04,504 INFO L226 Difference]: Without dead ends: 54 [2025-01-08 22:48:04,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,509 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:04,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-08 22:48:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-08 22:48:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-01-08 22:48:04,512 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 15 [2025-01-08 22:48:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-01-08 22:48:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-01-08 22:48:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:48:04,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:04,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:04,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:48:04,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:04,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1681181827, now seen corresponding path program 1 times [2025-01-08 22:48:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443504838] [2025-01-08 22:48:04,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:04,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:48:04,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:48:04,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:04,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443504838] [2025-01-08 22:48:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443504838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:04,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:04,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748895817] [2025-01-08 22:48:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:04,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:04,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:04,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,604 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:04,654 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2025-01-08 22:48:04,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:04,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:48:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:04,654 INFO L225 Difference]: With dead ends: 78 [2025-01-08 22:48:04,654 INFO L226 Difference]: Without dead ends: 59 [2025-01-08 22:48:04,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:04,655 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 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.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:04,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-08 22:48:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-01-08 22:48:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-01-08 22:48:04,658 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 16 [2025-01-08 22:48:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:04,658 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-01-08 22:48:04,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-01-08 22:48:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:48:04,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:04,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:04,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:48:04,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:04,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1505536327, now seen corresponding path program 1 times [2025-01-08 22:48:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:04,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839652394] [2025-01-08 22:48:04,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:04,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:48:04,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:48:04,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:04,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839652394] [2025-01-08 22:48:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839652394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624367252] [2025-01-08 22:48:04,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:04,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:04,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:04,766 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-08 22:48:04,767 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-08 22:48:04,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-08 22:48:04,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:48:04,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:04,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:04,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:48:04,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:04,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624367252] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2025-01-08 22:48:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054757346] [2025-01-08 22:48:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:04,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:04,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:04,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:48:04,939 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:05,006 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2025-01-08 22:48:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:05,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-08 22:48:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:05,007 INFO L225 Difference]: With dead ends: 81 [2025-01-08 22:48:05,007 INFO L226 Difference]: Without dead ends: 71 [2025-01-08 22:48:05,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:48:05,007 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:05,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-08 22:48:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-08 22:48:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2025-01-08 22:48:05,012 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 17 [2025-01-08 22:48:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-01-08 22:48:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2025-01-08 22:48:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-08 22:48:05,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:05,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:05,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:05,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:05,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1042563454, now seen corresponding path program 1 times [2025-01-08 22:48:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:05,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959461988] [2025-01-08 22:48:05,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:05,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 22:48:05,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 22:48:05,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:05,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959461988] [2025-01-08 22:48:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959461988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568952992] [2025-01-08 22:48:05,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:05,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:05,307 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-08 22:48:05,311 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-08 22:48:05,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-08 22:48:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-08 22:48:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:05,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:48:05,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568952992] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 12 [2025-01-08 22:48:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901152637] [2025-01-08 22:48:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:05,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:05,523 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:05,612 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2025-01-08 22:48:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-08 22:48:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:05,614 INFO L225 Difference]: With dead ends: 83 [2025-01-08 22:48:05,615 INFO L226 Difference]: Without dead ends: 75 [2025-01-08 22:48:05,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:05,615 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:05,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 84 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-08 22:48:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-01-08 22:48:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-01-08 22:48:05,623 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 18 [2025-01-08 22:48:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:05,623 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-01-08 22:48:05,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-01-08 22:48:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:48:05,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:05,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:05,632 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-08 22:48:05,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:05,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 708335164, now seen corresponding path program 1 times [2025-01-08 22:48:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900405061] [2025-01-08 22:48:05,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:05,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:48:05,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:48:05,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:05,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900405061] [2025-01-08 22:48:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900405061] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461130377] [2025-01-08 22:48:05,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:05,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:05,909 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-08 22:48:05,911 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-08 22:48:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:48:05,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:48:05,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:05,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:05,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:48:05,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:06,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461130377] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:06,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:06,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 11 [2025-01-08 22:48:06,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742644929] [2025-01-08 22:48:06,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:06,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:06,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:06,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:06,072 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:06,135 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2025-01-08 22:48:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:06,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-08 22:48:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:06,136 INFO L225 Difference]: With dead ends: 81 [2025-01-08 22:48:06,136 INFO L226 Difference]: Without dead ends: 71 [2025-01-08 22:48:06,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:06,137 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:06,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-08 22:48:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2025-01-08 22:48:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-01-08 22:48:06,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 19 [2025-01-08 22:48:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:06,140 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-01-08 22:48:06,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-01-08 22:48:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:48:06,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:06,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:06,146 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-08 22:48:06,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:06,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:06,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash -265174931, now seen corresponding path program 1 times [2025-01-08 22:48:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800776286] [2025-01-08 22:48:06,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:06,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:48:06,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:48:06,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:06,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:06,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:06,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800776286] [2025-01-08 22:48:06,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800776286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:06,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911238149] [2025-01-08 22:48:06,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:06,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:06,488 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-08 22:48:06,492 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-08 22:48:06,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:48:06,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:48:06,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:06,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:06,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-08 22:48:06,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:06,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911238149] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 14 [2025-01-08 22:48:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246321533] [2025-01-08 22:48:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:06,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:48:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:06,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:48:06,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:06,679 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:06,770 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2025-01-08 22:48:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:48:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-08 22:48:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:06,771 INFO L225 Difference]: With dead ends: 83 [2025-01-08 22:48:06,771 INFO L226 Difference]: Without dead ends: 77 [2025-01-08 22:48:06,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:06,771 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:06,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-08 22:48:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2025-01-08 22:48:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-01-08 22:48:06,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 19 [2025-01-08 22:48:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:06,775 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-01-08 22:48:06,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-01-08 22:48:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:48:06,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:06,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:06,781 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-08 22:48:06,976 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,SelfDestructingSolverStorable8 [2025-01-08 22:48:06,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:06,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1998540336, now seen corresponding path program 1 times [2025-01-08 22:48:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424020716] [2025-01-08 22:48:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:06,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:06,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:07,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424020716] [2025-01-08 22:48:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424020716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:07,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21764732] [2025-01-08 22:48:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:07,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:07,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:07,017 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:07,035 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2025-01-08 22:48:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:48:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:07,036 INFO L225 Difference]: With dead ends: 114 [2025-01-08 22:48:07,036 INFO L226 Difference]: Without dead ends: 58 [2025-01-08 22:48:07,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:07,037 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 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.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:07,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-08 22:48:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-01-08 22:48:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-01-08 22:48:07,042 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 20 [2025-01-08 22:48:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:07,043 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-01-08 22:48:07,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-01-08 22:48:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:48:07,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:07,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:07,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:48:07,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1998480754, now seen corresponding path program 1 times [2025-01-08 22:48:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090853376] [2025-01-08 22:48:07,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:07,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:07,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:07,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090853376] [2025-01-08 22:48:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090853376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:07,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391148325] [2025-01-08 22:48:07,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:07,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:07,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:07,183 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-08 22:48:07,184 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-08 22:48:07,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:07,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:07,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:07,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:48:07,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:07,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391148325] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:07,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:07,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 18 [2025-01-08 22:48:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755899507] [2025-01-08 22:48:07,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:07,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:48:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:07,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:48:07,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:48:07,411 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:07,513 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2025-01-08 22:48:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:48:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:07,515 INFO L225 Difference]: With dead ends: 97 [2025-01-08 22:48:07,515 INFO L226 Difference]: Without dead ends: 89 [2025-01-08 22:48:07,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:48:07,516 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:07,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 102 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-08 22:48:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2025-01-08 22:48:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-01-08 22:48:07,519 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 20 [2025-01-08 22:48:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:07,519 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-01-08 22:48:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-01-08 22:48:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:48:07,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:07,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:07,526 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-08 22:48:07,720 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,SelfDestructingSolverStorable10 [2025-01-08 22:48:07,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1349845915, now seen corresponding path program 1 times [2025-01-08 22:48:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586216300] [2025-01-08 22:48:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:07,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:07,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:07,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:07,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586216300] [2025-01-08 22:48:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586216300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850273301] [2025-01-08 22:48:07,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:07,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:07,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:07,955 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-08 22:48:07,961 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-08 22:48:07,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:07,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:07,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:07,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:48:07,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:08,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850273301] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:08,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6] total 11 [2025-01-08 22:48:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256171672] [2025-01-08 22:48:08,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:08,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:08,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:08,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:08,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:08,116 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:08,185 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2025-01-08 22:48:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:48:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:08,186 INFO L225 Difference]: With dead ends: 115 [2025-01-08 22:48:08,186 INFO L226 Difference]: Without dead ends: 77 [2025-01-08 22:48:08,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:08,186 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:08,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 85 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-08 22:48:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-08 22:48:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2025-01-08 22:48:08,193 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 20 [2025-01-08 22:48:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:08,194 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-01-08 22:48:08,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2025-01-08 22:48:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 22:48:08,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:08,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:08,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:48:08,397 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,SelfDestructingSolverStorable11 [2025-01-08 22:48:08,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash -756749590, now seen corresponding path program 1 times [2025-01-08 22:48:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498713928] [2025-01-08 22:48:08,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:48:08,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:48:08,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:48:08,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:48:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 22:48:08,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 22:48:08,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:08,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:48:08,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:48:08,416 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:48:08,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:48:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:48:08,419 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:08,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:48:08,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:48:08 BoogieIcfgContainer [2025-01-08 22:48:08,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:48:08,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:48:08,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:48:08,432 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:48:08,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:03" (3/4) ... [2025-01-08 22:48:08,433 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-08 22:48:08,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:48:08,434 INFO L158 Benchmark]: Toolchain (without parser) took 5292.82ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 67.8MB in the end (delta: 44.9MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:08,434 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:08,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.12ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:08,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.37ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:08,435 INFO L158 Benchmark]: Boogie Preprocessor took 30.64ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:08,435 INFO L158 Benchmark]: RCFGBuilder took 217.46ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:48:08,435 INFO L158 Benchmark]: TraceAbstraction took 4862.72ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 67.8MB in the end (delta: 18.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2025-01-08 22:48:08,435 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 67.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:08,436 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.12ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.37ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.64ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 217.46ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4862.72ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 67.8MB in the end (delta: 18.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 67.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 61. Possible FailurePath: [L42] unsigned int v = __VERIFIER_nondet_uint(); [L43] unsigned int v1; [L44] unsigned int v2; [L45] char parity1; [L46] char parity2; [L47] v1 = v [L48] parity1 = (char)0 VAL [parity1=0, v1=-4294967295, v=-4294967295] [L49] COND TRUE v1 != 0 VAL [parity1=0, v1=-4294967295, v=-4294967295] [L50] COND TRUE parity1 == (char)0 [L51] parity1 = (char)1 VAL [parity1=1, v1=-4294967295, v=-4294967295] [L55] EXPR v1 & (v1 - 1U) VAL [parity1=1, v=-4294967295] [L55] v1 = v1 & (v1 - 1U) [L49] COND FALSE !(v1 != 0) [L57] v2 = v [L58] parity2 = (char)0 VAL [parity1=1, v2=-4294967295] [L59] EXPR v2 ^ (v2 >> 1u) VAL [parity1=1] [L59] v2 = v2 ^ (v2 >> 1u) [L60] EXPR v2 ^ (v2 >> 2u) VAL [parity1=1] [L60] v2 = v2 ^ (v2 >> 2u) [L61] EXPR v2 & 286331153U VAL [parity1=1] [L61] v2 = (v2 & 286331153U) * 286331153U [L62] COND TRUE ((v2 >> 28u) & 1u) == 0 [L63] parity2 = (char)0 VAL [parity1=1, parity2=0] [L67] CALL __VERIFIER_assert(parity1 == parity2) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 737 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 363 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 189 SyntacticMatches, 23 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=12, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 78 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1785 SizeOfPredicates, 1 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 7/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-08 22:48:08,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/parity.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:10,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:10,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-08 22:48:10,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:10,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:10,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:10,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:10,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:10,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:10,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:10,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:10,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:10,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:10,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:10,472 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:10,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:10,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:10,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:10,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:10,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:10,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:10,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:10,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:10,474 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 -> d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3 [2025-01-08 22:48:10,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:10,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:10,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:10,730 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:10,732 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:10,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/parity.i [2025-01-08 22:48:11,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8b608bb0/0fafb6cf3a8448d589d5e7fe44d2e022/FLAG28e0067c8 [2025-01-08 22:48:12,071 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:12,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i [2025-01-08 22:48:12,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8b608bb0/0fafb6cf3a8448d589d5e7fe44d2e022/FLAG28e0067c8 [2025-01-08 22:48:12,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8b608bb0/0fafb6cf3a8448d589d5e7fe44d2e022 [2025-01-08 22:48:12,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:12,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:12,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:12,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:12,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:12,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b51a0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12, skipping insertion in model container [2025-01-08 22:48:12,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:12,213 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/bitvector/parity.i[1162,1175] [2025-01-08 22:48:12,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:12,237 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:12,244 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/bitvector/parity.i[1162,1175] [2025-01-08 22:48:12,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:12,261 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:12,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12 WrapperNode [2025-01-08 22:48:12,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:12,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:12,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:12,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:12,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,284 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-01-08 22:48:12,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:12,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:12,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:12,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:12,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,303 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-08 22:48:12,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:12,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:12,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:12,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:12,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (1/1) ... [2025-01-08 22:48:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:12,343 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-08 22:48:12,357 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-08 22:48:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-08 22:48:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:12,422 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:12,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:12,517 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:12,517 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:12,522 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:12,522 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:48:12,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:12 BoogieIcfgContainer [2025-01-08 22:48:12,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:12,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:12,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:12,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:12,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:12" (1/3) ... [2025-01-08 22:48:12,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424238ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:12, skipping insertion in model container [2025-01-08 22:48:12,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:12" (2/3) ... [2025-01-08 22:48:12,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424238ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:12, skipping insertion in model container [2025-01-08 22:48:12,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:12" (3/3) ... [2025-01-08 22:48:12,530 INFO L128 eAbstractionObserver]: Analyzing ICFG parity.i [2025-01-08 22:48:12,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:12,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parity.i that has 1 procedures, 14 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:48:12,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:12,598 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;@603e2122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:12,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-08 22:48:12,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:12,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:12,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:12,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1814479634, now seen corresponding path program 1 times [2025-01-08 22:48:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073885703] [2025-01-08 22:48:12,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:12,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:12,622 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-08 22:48:12,624 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-08 22:48:12,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-08 22:48:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-08 22:48:12,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:12,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:48:12,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:12,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:12,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073885703] [2025-01-08 22:48:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073885703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:12,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636572111] [2025-01-08 22:48:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:12,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:12,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:12,794 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:12,839 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-01-08 22:48:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-08 22:48:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:12,846 INFO L225 Difference]: With dead ends: 33 [2025-01-08 22:48:12,846 INFO L226 Difference]: Without dead ends: 15 [2025-01-08 22:48:12,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:12,851 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:12,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-08 22:48:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-08 22:48:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-01-08 22:48:12,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2025-01-08 22:48:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:12,874 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-08 22:48:12,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-01-08 22:48:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-08 22:48:12,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:12,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:12,883 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-08 22:48:13,077 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 [2025-01-08 22:48:13,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1814539216, now seen corresponding path program 1 times [2025-01-08 22:48:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669008588] [2025-01-08 22:48:13,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:13,081 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-08 22:48:13,083 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-08 22:48:13,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-08 22:48:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-08 22:48:13,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:48:13,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:13,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:13,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:13,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669008588] [2025-01-08 22:48:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669008588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:13,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566500865] [2025-01-08 22:48:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:13,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:13,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:13,175 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,197 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-01-08 22:48:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-08 22:48:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,198 INFO L225 Difference]: With dead ends: 22 [2025-01-08 22:48:13,198 INFO L226 Difference]: Without dead ends: 17 [2025-01-08 22:48:13,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:13,199 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-08 22:48:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-01-08 22:48:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-01-08 22:48:13,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2025-01-08 22:48:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,201 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-01-08 22:48:13,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-01-08 22:48:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:48:13,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:13,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:13,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:13,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash 534222926, now seen corresponding path program 1 times [2025-01-08 22:48:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:13,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999893617] [2025-01-08 22:48:13,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:13,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:13,409 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-08 22:48:13,411 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-08 22:48:13,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:48:13,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:48:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:13,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:48:13,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:13,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:13,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999893617] [2025-01-08 22:48:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999893617] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:13,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-08 22:48:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092548393] [2025-01-08 22:48:13,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:48:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:13,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:48:13,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:48:13,821 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:13,955 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-01-08 22:48:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:48:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:48:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:13,956 INFO L225 Difference]: With dead ends: 36 [2025-01-08 22:48:13,957 INFO L226 Difference]: Without dead ends: 32 [2025-01-08 22:48:13,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:48:13,957 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:13,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-08 22:48:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-01-08 22:48:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-01-08 22:48:13,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2025-01-08 22:48:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:13,962 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-01-08 22:48:13,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-01-08 22:48:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:48:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:13,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:48:14,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:14,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash 534282508, now seen corresponding path program 1 times [2025-01-08 22:48:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:14,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361926548] [2025-01-08 22:48:14,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:14,170 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-08 22:48:14,172 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-08 22:48:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:48:14,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:48:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:48:14,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:14,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:14,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361926548] [2025-01-08 22:48:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361926548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895792490] [2025-01-08 22:48:14,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:14,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:14,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:14,228 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:14,244 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-01-08 22:48:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:14,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:48:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:14,245 INFO L225 Difference]: With dead ends: 45 [2025-01-08 22:48:14,245 INFO L226 Difference]: Without dead ends: 25 [2025-01-08 22:48:14,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:14,247 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:14,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-08 22:48:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-01-08 22:48:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-01-08 22:48:14,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2025-01-08 22:48:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:14,253 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-01-08 22:48:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-01-08 22:48:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:48:14,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:14,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:14,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:14,458 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 [2025-01-08 22:48:14,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:14,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1491290322, now seen corresponding path program 1 times [2025-01-08 22:48:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536891679] [2025-01-08 22:48:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:14,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:14,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:14,462 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-08 22:48:14,463 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-08 22:48:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:48:14,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:48:14,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:14,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:14,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:48:14,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:14,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:15,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:15,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536891679] [2025-01-08 22:48:15,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536891679] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:15,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:15,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-08 22:48:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10161785] [2025-01-08 22:48:15,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:15,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:48:15,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:15,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:48:15,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:15,062 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:15,192 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-01-08 22:48:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:48:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:48:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:15,193 INFO L225 Difference]: With dead ends: 33 [2025-01-08 22:48:15,193 INFO L226 Difference]: Without dead ends: 27 [2025-01-08 22:48:15,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:15,193 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:15,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-08 22:48:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-08 22:48:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-01-08 22:48:15,197 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 13 [2025-01-08 22:48:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:15,197 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-01-08 22:48:15,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-01-08 22:48:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:48:15,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:15,198 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:15,203 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-08 22:48:15,398 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 [2025-01-08 22:48:15,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 624142666, now seen corresponding path program 1 times [2025-01-08 22:48:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182194804] [2025-01-08 22:48:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:15,401 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-08 22:48:15,402 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-08 22:48:15,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:48:15,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:48:15,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:15,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:15,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:48:15,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:16,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:18,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182194804] [2025-01-08 22:48:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182194804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:18,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-01-08 22:48:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356746046] [2025-01-08 22:48:18,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:18,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:48:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:18,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:48:18,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:48:18,726 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:23,219 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-01-08 22:48:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-08 22:48:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 22:48:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:23,221 INFO L225 Difference]: With dead ends: 54 [2025-01-08 22:48:23,221 INFO L226 Difference]: Without dead ends: 48 [2025-01-08 22:48:23,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:48:23,222 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:23,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:48:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-08 22:48:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-08 22:48:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-08 22:48:23,230 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2025-01-08 22:48:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:23,230 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-08 22:48:23,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-08 22:48:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:48:23,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:23,232 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:23,237 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-08 22:48:23,432 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 [2025-01-08 22:48:23,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 230671958, now seen corresponding path program 2 times [2025-01-08 22:48:23,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295461125] [2025-01-08 22:48:23,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:23,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:23,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:23,436 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-08 22:48:23,437 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-08 22:48:23,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:48:23,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:48:23,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:23,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:48:23,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:24,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:28,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295461125] [2025-01-08 22:48:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295461125] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:28,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2025-01-08 22:48:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662295618] [2025-01-08 22:48:28,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:28,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-08 22:48:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:28,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-08 22:48:28,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-01-08 22:48:28,911 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:34,699 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2025-01-08 22:48:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-08 22:48:34,699 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:48:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:34,700 INFO L225 Difference]: With dead ends: 57 [2025-01-08 22:48:34,700 INFO L226 Difference]: Without dead ends: 51 [2025-01-08 22:48:34,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2025-01-08 22:48:34,701 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:34,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:48:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-08 22:48:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-08 22:48:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-01-08 22:48:34,706 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 25 [2025-01-08 22:48:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,706 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-01-08 22:48:34,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-01-08 22:48:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:48:34,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,707 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:34,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:48:34,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:34,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash -810943166, now seen corresponding path program 2 times [2025-01-08 22:48:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:34,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373030654] [2025-01-08 22:48:34,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:34,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:34,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:34,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:34,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:48:34,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-08 22:48:35,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:48:35,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:35,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:35,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-08 22:48:35,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:43,994 INFO L312 TraceCheckSpWp]: Computing backward predicates...