./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:14:22,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:14:23,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:14:23,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:14:23,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:14:23,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:14:23,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:14:23,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:14:23,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:14:23,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:14:23,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:14:23,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:14:23,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:14:23,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:14:23,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:14:23,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:14:23,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:14:23,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:14:23,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:14:23,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:14:23,052 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2025-02-07 23:14:23,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:14:23,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:14:23,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:14:23,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:14:23,271 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:14:23,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-02-07 23:14:24,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98563b44e/81c936179ed141c59c06c91ced18ceb6/FLAG155d7b8ad [2025-02-07 23:14:24,608 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:14:24,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-02-07 23:14:24,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98563b44e/81c936179ed141c59c06c91ced18ceb6/FLAG155d7b8ad [2025-02-07 23:14:24,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98563b44e/81c936179ed141c59c06c91ced18ceb6 [2025-02-07 23:14:24,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:14:24,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:14:24,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:14:24,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:14:24,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:14:24,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:14:24" (1/1) ... [2025-02-07 23:14:24,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eed51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:24, skipping insertion in model container [2025-02-07 23:14:24,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:14:24" (1/1) ... [2025-02-07 23:14:24,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:14:25,070 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/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-02-07 23:14:25,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:14:25,175 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:14:25,184 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/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-02-07 23:14:25,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:14:25,241 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:14:25,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25 WrapperNode [2025-02-07 23:14:25,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:14:25,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:14:25,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:14:25,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:14:25,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,300 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2025-02-07 23:14:25,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:14:25,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:14:25,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:14:25,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:14:25,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,341 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:14:25,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:14:25,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:14:25,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:14:25,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:14:25,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (1/1) ... [2025-02-07 23:14:25,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:14:25,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:25,413 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-02-07 23:14:25,416 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-02-07 23:14:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:14:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:14:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 23:14:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:14:25,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:14:25,535 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:14:25,537 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:14:26,179 INFO L? ?]: Removed 305 outVars from TransFormulas that were not future-live. [2025-02-07 23:14:26,179 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:14:26,210 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:14:26,210 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:14:26,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:26 BoogieIcfgContainer [2025-02-07 23:14:26,210 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:14:26,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:14:26,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:14:26,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:14:26,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:14:24" (1/3) ... [2025-02-07 23:14:26,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328fb1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:14:26, skipping insertion in model container [2025-02-07 23:14:26,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:25" (2/3) ... [2025-02-07 23:14:26,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328fb1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:14:26, skipping insertion in model container [2025-02-07 23:14:26,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:26" (3/3) ... [2025-02-07 23:14:26,219 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2025-02-07 23:14:26,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:14:26,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:14:26,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:14:26,274 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;@375cb977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:14:26,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:14:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 114 states have (on average 1.5) internal successors, (171), 115 states have internal predecessors, (171), 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-02-07 23:14:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 23:14:26,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:26,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:26,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:26,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 419352302, now seen corresponding path program 1 times [2025-02-07 23:14:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060718770] [2025-02-07 23:14:26,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:26,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 23:14:26,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 23:14:26,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:26,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060718770] [2025-02-07 23:14:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060718770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639587641] [2025-02-07 23:14:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:26,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:26,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:26,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:26,678 INFO L87 Difference]: Start difference. First operand has 116 states, 114 states have (on average 1.5) internal successors, (171), 115 states have internal predecessors, (171), 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 4.5) internal successors, (18), 4 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-02-07 23:14:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:26,808 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2025-02-07 23:14:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-02-07 23:14:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:26,815 INFO L225 Difference]: With dead ends: 223 [2025-02-07 23:14:26,815 INFO L226 Difference]: Without dead ends: 116 [2025-02-07 23:14:26,817 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-02-07 23:14:26,818 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:26,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-07 23:14:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-07 23:14:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 115 states have internal predecessors, (170), 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-02-07 23:14:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2025-02-07 23:14:26,841 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 18 [2025-02-07 23:14:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:26,841 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2025-02-07 23:14:26,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-02-07 23:14:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2025-02-07 23:14:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 23:14:26,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:26,842 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-02-07 23:14:26,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:14:26,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:26,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash 119698757, now seen corresponding path program 1 times [2025-02-07 23:14:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:26,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251993184] [2025-02-07 23:14:26,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:26,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 23:14:26,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 23:14:26,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:26,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251993184] [2025-02-07 23:14:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251993184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010585803] [2025-02-07 23:14:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:26,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:26,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:26,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:26,991 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-02-07 23:14:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:27,083 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2025-02-07 23:14:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-02-07 23:14:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:27,085 INFO L225 Difference]: With dead ends: 225 [2025-02-07 23:14:27,086 INFO L226 Difference]: Without dead ends: 118 [2025-02-07 23:14:27,086 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-02-07 23:14:27,087 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:27,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-07 23:14:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-07 23:14:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 117 states have internal predecessors, (172), 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-02-07 23:14:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-02-07 23:14:27,096 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 19 [2025-02-07 23:14:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:27,097 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-02-07 23:14:27,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-02-07 23:14:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-02-07 23:14:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 23:14:27,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:27,097 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-02-07 23:14:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:14:27,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:27,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1347203529, now seen corresponding path program 1 times [2025-02-07 23:14:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823586118] [2025-02-07 23:14:27,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:27,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 23:14:27,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 23:14:27,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:27,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823586118] [2025-02-07 23:14:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823586118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:27,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163956408] [2025-02-07 23:14:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:27,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:27,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:27,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:27,364 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-02-07 23:14:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:27,440 INFO L93 Difference]: Finished difference Result 227 states and 331 transitions. [2025-02-07 23:14:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-02-07 23:14:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:27,442 INFO L225 Difference]: With dead ends: 227 [2025-02-07 23:14:27,442 INFO L226 Difference]: Without dead ends: 118 [2025-02-07 23:14:27,442 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-02-07 23:14:27,443 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:27,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 399 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-07 23:14:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-07 23:14:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 117 states have internal predecessors, (171), 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-02-07 23:14:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2025-02-07 23:14:27,452 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 20 [2025-02-07 23:14:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:27,452 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2025-02-07 23:14:27,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-02-07 23:14:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2025-02-07 23:14:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 23:14:27,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:27,454 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-02-07 23:14:27,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:14:27,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 701999082, now seen corresponding path program 1 times [2025-02-07 23:14:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955876250] [2025-02-07 23:14:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:27,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 23:14:27,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 23:14:27,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:27,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955876250] [2025-02-07 23:14:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955876250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:14:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371424442] [2025-02-07 23:14:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:27,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:14:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:27,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:14:27,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:27,748 INFO L87 Difference]: Start difference. First operand 118 states and 171 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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-02-07 23:14:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:27,944 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2025-02-07 23:14:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2025-02-07 23:14:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:27,946 INFO L225 Difference]: With dead ends: 237 [2025-02-07 23:14:27,946 INFO L226 Difference]: Without dead ends: 128 [2025-02-07 23:14:27,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:14:27,947 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 178 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:27,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 791 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-07 23:14:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-02-07 23:14:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4523809523809523) internal successors, (183), 126 states have internal predecessors, (183), 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-02-07 23:14:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2025-02-07 23:14:27,954 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 21 [2025-02-07 23:14:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:27,955 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2025-02-07 23:14:27,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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-02-07 23:14:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2025-02-07 23:14:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 23:14:27,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:27,956 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, 1] [2025-02-07 23:14:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:14:27,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1237209759, now seen corresponding path program 1 times [2025-02-07 23:14:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91471135] [2025-02-07 23:14:27,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:27,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:14:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:14:27,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:27,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:28,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91471135] [2025-02-07 23:14:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91471135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:28,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021422894] [2025-02-07 23:14:28,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:28,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:28,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:28,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:28,154 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-02-07 23:14:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:28,433 INFO L93 Difference]: Finished difference Result 315 states and 451 transitions. [2025-02-07 23:14:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:28,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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 22 [2025-02-07 23:14:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:28,435 INFO L225 Difference]: With dead ends: 315 [2025-02-07 23:14:28,435 INFO L226 Difference]: Without dead ends: 197 [2025-02-07 23:14:28,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:14:28,436 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 328 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:28,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 378 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-07 23:14:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 130. [2025-02-07 23:14:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.449612403100775) internal successors, (187), 129 states have internal predecessors, (187), 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-02-07 23:14:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2025-02-07 23:14:28,450 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 22 [2025-02-07 23:14:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:28,450 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2025-02-07 23:14:28,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-02-07 23:14:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2025-02-07 23:14:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 23:14:28,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:28,451 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, 1] [2025-02-07 23:14:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:14:28,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:28,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 828232984, now seen corresponding path program 1 times [2025-02-07 23:14:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191562563] [2025-02-07 23:14:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:28,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:14:28,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:14:28,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:28,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:28,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191562563] [2025-02-07 23:14:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191562563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905539064] [2025-02-07 23:14:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:28,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:28,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:28,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:28,692 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-02-07 23:14:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:28,774 INFO L93 Difference]: Finished difference Result 254 states and 365 transitions. [2025-02-07 23:14:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 22 [2025-02-07 23:14:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:28,776 INFO L225 Difference]: With dead ends: 254 [2025-02-07 23:14:28,776 INFO L226 Difference]: Without dead ends: 136 [2025-02-07 23:14:28,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:28,777 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 161 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:28,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 402 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-07 23:14:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-07 23:14:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 135 states have internal predecessors, (193), 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-02-07 23:14:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2025-02-07 23:14:28,786 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 22 [2025-02-07 23:14:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:28,786 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2025-02-07 23:14:28,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-02-07 23:14:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2025-02-07 23:14:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 23:14:28,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:28,787 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, 1, 1] [2025-02-07 23:14:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:14:28,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1842470132, now seen corresponding path program 1 times [2025-02-07 23:14:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739382412] [2025-02-07 23:14:28,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:28,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 23:14:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 23:14:28,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:28,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739382412] [2025-02-07 23:14:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739382412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225643622] [2025-02-07 23:14:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:28,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:28,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:28,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:28,898 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-02-07 23:14:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:28,986 INFO L93 Difference]: Finished difference Result 322 states and 454 transitions. [2025-02-07 23:14:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-02-07 23:14:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:28,987 INFO L225 Difference]: With dead ends: 322 [2025-02-07 23:14:28,987 INFO L226 Difference]: Without dead ends: 197 [2025-02-07 23:14:28,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:28,988 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 318 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:28,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 399 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-07 23:14:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 135. [2025-02-07 23:14:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 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-02-07 23:14:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 191 transitions. [2025-02-07 23:14:28,992 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 191 transitions. Word has length 23 [2025-02-07 23:14:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:28,992 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 191 transitions. [2025-02-07 23:14:28,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-02-07 23:14:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 191 transitions. [2025-02-07 23:14:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 23:14:28,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:28,993 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, 1, 1] [2025-02-07 23:14:28,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:14:28,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1071238814, now seen corresponding path program 1 times [2025-02-07 23:14:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310293796] [2025-02-07 23:14:28,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 23:14:29,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 23:14:29,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:29,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310293796] [2025-02-07 23:14:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310293796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:29,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:29,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767547196] [2025-02-07 23:14:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:29,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:29,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:29,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:29,073 INFO L87 Difference]: Start difference. First operand 135 states and 191 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-02-07 23:14:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:29,199 INFO L93 Difference]: Finished difference Result 347 states and 494 transitions. [2025-02-07 23:14:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-02-07 23:14:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:29,201 INFO L225 Difference]: With dead ends: 347 [2025-02-07 23:14:29,201 INFO L226 Difference]: Without dead ends: 223 [2025-02-07 23:14:29,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:29,202 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 416 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:29,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 375 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-07 23:14:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 137. [2025-02-07 23:14:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 136 states have internal predecessors, (193), 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-02-07 23:14:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2025-02-07 23:14:29,209 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 23 [2025-02-07 23:14:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:29,210 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2025-02-07 23:14:29,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-02-07 23:14:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2025-02-07 23:14:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 23:14:29,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:29,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:29,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:14:29,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:29,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1399422376, now seen corresponding path program 1 times [2025-02-07 23:14:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190320724] [2025-02-07 23:14:29,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:29,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 23:14:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 23:14:29,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:29,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190320724] [2025-02-07 23:14:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190320724] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:14:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48354553] [2025-02-07 23:14:30,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:30,927 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-02-07 23:14:30,929 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-02-07 23:14:31,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 23:14:31,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 23:14:31,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:31,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-07 23:14:31,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:14:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:32,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:14:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48354553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:14:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-02-07 23:14:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016448809] [2025-02-07 23:14:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:14:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:32,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:14:32,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:14:32,096 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 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-02-07 23:14:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:32,603 INFO L93 Difference]: Finished difference Result 380 states and 542 transitions. [2025-02-07 23:14:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:14:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2025-02-07 23:14:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:32,605 INFO L225 Difference]: With dead ends: 380 [2025-02-07 23:14:32,606 INFO L226 Difference]: Without dead ends: 256 [2025-02-07 23:14:32,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:14:32,606 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 397 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:32,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 449 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-07 23:14:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2025-02-07 23:14:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4227272727272726) internal successors, (313), 220 states have internal predecessors, (313), 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-02-07 23:14:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 313 transitions. [2025-02-07 23:14:32,616 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 313 transitions. Word has length 76 [2025-02-07 23:14:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:32,617 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 313 transitions. [2025-02-07 23:14:32,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 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-02-07 23:14:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 313 transitions. [2025-02-07 23:14:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-07 23:14:32,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:32,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:32,630 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-02-07 23:14:32,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:32,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1711923850, now seen corresponding path program 1 times [2025-02-07 23:14:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360579453] [2025-02-07 23:14:32,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 23:14:33,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 23:14:33,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:33,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360579453] [2025-02-07 23:14:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360579453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:33,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:33,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144369084] [2025-02-07 23:14:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:33,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:33,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:33,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:33,316 INFO L87 Difference]: Start difference. First operand 221 states and 313 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-02-07 23:14:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:33,482 INFO L93 Difference]: Finished difference Result 379 states and 539 transitions. [2025-02-07 23:14:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:14:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2025-02-07 23:14:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:33,483 INFO L225 Difference]: With dead ends: 379 [2025-02-07 23:14:33,484 INFO L226 Difference]: Without dead ends: 231 [2025-02-07 23:14:33,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:33,484 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 131 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:33,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 566 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-07 23:14:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-07 23:14:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 230 states have internal predecessors, (325), 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-02-07 23:14:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 325 transitions. [2025-02-07 23:14:33,490 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 325 transitions. Word has length 77 [2025-02-07 23:14:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:33,490 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 325 transitions. [2025-02-07 23:14:33,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-02-07 23:14:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 325 transitions. [2025-02-07 23:14:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-07 23:14:33,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:33,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:33,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:14:33,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:33,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1039605829, now seen corresponding path program 1 times [2025-02-07 23:14:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984579863] [2025-02-07 23:14:33,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:33,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 23:14:33,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 23:14:33,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:33,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984579863] [2025-02-07 23:14:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984579863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:14:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381084708] [2025-02-07 23:14:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:34,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:14:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:34,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:14:34,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:34,150 INFO L87 Difference]: Start difference. First operand 231 states and 325 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-02-07 23:14:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:34,483 INFO L93 Difference]: Finished difference Result 389 states and 550 transitions. [2025-02-07 23:14:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:34,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 77 [2025-02-07 23:14:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:34,486 INFO L225 Difference]: With dead ends: 389 [2025-02-07 23:14:34,486 INFO L226 Difference]: Without dead ends: 260 [2025-02-07 23:14:34,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:14:34,486 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 389 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:34,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 490 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-07 23:14:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 244. [2025-02-07 23:14:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4156378600823045) internal successors, (344), 243 states have internal predecessors, (344), 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-02-07 23:14:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 344 transitions. [2025-02-07 23:14:34,494 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 344 transitions. Word has length 77 [2025-02-07 23:14:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:34,494 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 344 transitions. [2025-02-07 23:14:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-02-07 23:14:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 344 transitions. [2025-02-07 23:14:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 23:14:34,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:34,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:14:34,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1933110227, now seen corresponding path program 1 times [2025-02-07 23:14:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483038367] [2025-02-07 23:14:34,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:34,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 23:14:34,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 23:14:34,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:34,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483038367] [2025-02-07 23:14:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483038367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827730358] [2025-02-07 23:14:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:34,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:34,980 INFO L87 Difference]: Start difference. First operand 244 states and 344 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-02-07 23:14:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:35,107 INFO L93 Difference]: Finished difference Result 394 states and 555 transitions. [2025-02-07 23:14:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:35,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-02-07 23:14:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:35,108 INFO L225 Difference]: With dead ends: 394 [2025-02-07 23:14:35,108 INFO L226 Difference]: Without dead ends: 250 [2025-02-07 23:14:35,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:35,109 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 365 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:35,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 376 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-07 23:14:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2025-02-07 23:14:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.405857740585774) internal successors, (336), 239 states have internal predecessors, (336), 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-02-07 23:14:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 336 transitions. [2025-02-07 23:14:35,122 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 336 transitions. Word has length 78 [2025-02-07 23:14:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:35,122 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 336 transitions. [2025-02-07 23:14:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-02-07 23:14:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 336 transitions. [2025-02-07 23:14:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 23:14:35,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:35,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:35,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:14:35,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:35,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1241316944, now seen corresponding path program 1 times [2025-02-07 23:14:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776928579] [2025-02-07 23:14:35,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:35,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 23:14:35,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 23:14:35,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:35,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776928579] [2025-02-07 23:14:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776928579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:14:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449347373] [2025-02-07 23:14:36,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:36,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:36,465 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-02-07 23:14:36,468 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-02-07 23:14:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 23:14:36,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 23:14:36,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:36,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:36,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-02-07 23:14:36,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:14:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:37,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:14:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449347373] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:14:38,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:14:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 17] total 37 [2025-02-07 23:14:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389825619] [2025-02-07 23:14:38,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:14:38,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 23:14:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:38,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 23:14:38,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1234, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 23:14:38,987 INFO L87 Difference]: Start difference. First operand 240 states and 336 transitions. Second operand has 38 states, 38 states have (on average 5.7105263157894735) internal successors, (217), 37 states have internal predecessors, (217), 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-02-07 23:14:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:41,423 INFO L93 Difference]: Finished difference Result 713 states and 1004 transitions. [2025-02-07 23:14:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-07 23:14:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.7105263157894735) internal successors, (217), 37 states have internal predecessors, (217), 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 78 [2025-02-07 23:14:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:41,425 INFO L225 Difference]: With dead ends: 713 [2025-02-07 23:14:41,425 INFO L226 Difference]: Without dead ends: 522 [2025-02-07 23:14:41,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=929, Invalid=6211, Unknown=0, NotChecked=0, Total=7140 [2025-02-07 23:14:41,428 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1644 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:41,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 1908 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 23:14:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-07 23:14:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 421. [2025-02-07 23:14:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.411904761904762) internal successors, (593), 420 states have internal predecessors, (593), 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-02-07 23:14:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 593 transitions. [2025-02-07 23:14:41,441 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 593 transitions. Word has length 78 [2025-02-07 23:14:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:41,441 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 593 transitions. [2025-02-07 23:14:41,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.7105263157894735) internal successors, (217), 37 states have internal predecessors, (217), 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-02-07 23:14:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 593 transitions. [2025-02-07 23:14:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 23:14:41,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:41,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:41,451 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-02-07 23:14:41,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:41,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:41,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1546322349, now seen corresponding path program 1 times [2025-02-07 23:14:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237899091] [2025-02-07 23:14:41,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:41,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 23:14:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 23:14:41,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:14:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237899091] [2025-02-07 23:14:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237899091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:14:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028384606] [2025-02-07 23:14:42,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:42,494 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-02-07 23:14:42,495 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-02-07 23:14:42,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 23:14:42,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 23:14:42,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:42,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:42,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-02-07 23:14:42,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:14:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:43,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:14:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028384606] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:14:47,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:14:47,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 26] total 52 [2025-02-07 23:14:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061771160] [2025-02-07 23:14:47,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:14:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-07 23:14:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:47,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-07 23:14:47,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2425, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 23:14:47,568 INFO L87 Difference]: Start difference. First operand 421 states and 593 transitions. Second operand has 53 states, 53 states have (on average 4.283018867924528) internal successors, (227), 52 states have internal predecessors, (227), 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-02-07 23:14:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:52,090 INFO L93 Difference]: Finished difference Result 1321 states and 1881 transitions. [2025-02-07 23:14:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-02-07 23:14:52,090 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.283018867924528) internal successors, (227), 52 states have internal predecessors, (227), 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 79 [2025-02-07 23:14:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:52,093 INFO L225 Difference]: With dead ends: 1321 [2025-02-07 23:14:52,093 INFO L226 Difference]: Without dead ends: 1077 [2025-02-07 23:14:52,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3845 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1761, Invalid=13989, Unknown=0, NotChecked=0, Total=15750 [2025-02-07 23:14:52,096 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 2311 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 3788 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 3839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:52,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 1598 Invalid, 3839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3788 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 23:14:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-02-07 23:14:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 680. [2025-02-07 23:14:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.4050073637702503) internal successors, (954), 679 states have internal predecessors, (954), 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-02-07 23:14:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 954 transitions. [2025-02-07 23:14:52,109 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 954 transitions. Word has length 79 [2025-02-07 23:14:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:52,110 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 954 transitions. [2025-02-07 23:14:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.283018867924528) internal successors, (227), 52 states have internal predecessors, (227), 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-02-07 23:14:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 954 transitions. [2025-02-07 23:14:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 23:14:52,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:52,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:52,119 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-02-07 23:14:52,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:52,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1168499926, now seen corresponding path program 1 times [2025-02-07 23:14:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:52,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049764164] [2025-02-07 23:14:52,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:52,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 23:14:52,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 23:14:52,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:52,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049764164] [2025-02-07 23:14:52,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049764164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:52,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:52,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541014979] [2025-02-07 23:14:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:52,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:52,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:52,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:52,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:52,662 INFO L87 Difference]: Start difference. First operand 680 states and 954 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 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-02-07 23:14:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:52,805 INFO L93 Difference]: Finished difference Result 1344 states and 1893 transitions. [2025-02-07 23:14:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:14:52,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2025-02-07 23:14:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:52,807 INFO L225 Difference]: With dead ends: 1344 [2025-02-07 23:14:52,807 INFO L226 Difference]: Without dead ends: 705 [2025-02-07 23:14:52,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:52,808 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 147 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:52,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 566 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-07 23:14:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-02-07 23:14:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3977272727272727) internal successors, (984), 704 states have internal predecessors, (984), 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-02-07 23:14:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 984 transitions. [2025-02-07 23:14:52,823 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 984 transitions. Word has length 79 [2025-02-07 23:14:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 984 transitions. [2025-02-07 23:14:52,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 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-02-07 23:14:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 984 transitions. [2025-02-07 23:14:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 23:14:52,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:52,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:52,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:14:52,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:52,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 437750357, now seen corresponding path program 1 times [2025-02-07 23:14:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:52,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848758468] [2025-02-07 23:14:52,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:52,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 23:14:52,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 23:14:52,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:52,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848758468] [2025-02-07 23:14:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848758468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187807640] [2025-02-07 23:14:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:52,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:52,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:52,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:52,993 INFO L87 Difference]: Start difference. First operand 705 states and 984 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-02-07 23:14:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:53,066 INFO L93 Difference]: Finished difference Result 1458 states and 2040 transitions. [2025-02-07 23:14:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-02-07 23:14:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:53,069 INFO L225 Difference]: With dead ends: 1458 [2025-02-07 23:14:53,069 INFO L226 Difference]: Without dead ends: 797 [2025-02-07 23:14:53,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:53,071 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 16 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:53,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 531 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-02-07 23:14:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 765. [2025-02-07 23:14:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.3926701570680629) internal successors, (1064), 764 states have internal predecessors, (1064), 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-02-07 23:14:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1064 transitions. [2025-02-07 23:14:53,082 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1064 transitions. Word has length 80 [2025-02-07 23:14:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:53,083 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1064 transitions. [2025-02-07 23:14:53,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-02-07 23:14:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1064 transitions. [2025-02-07 23:14:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 23:14:53,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:53,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:14:53,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:53,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2086029562, now seen corresponding path program 1 times [2025-02-07 23:14:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083362231] [2025-02-07 23:14:53,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:53,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 23:14:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 23:14:53,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:53,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083362231] [2025-02-07 23:14:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083362231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:14:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585477305] [2025-02-07 23:14:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:14:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:53,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:14:53,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:53,487 INFO L87 Difference]: Start difference. First operand 765 states and 1064 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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-02-07 23:14:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:53,572 INFO L93 Difference]: Finished difference Result 1517 states and 2118 transitions. [2025-02-07 23:14:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-02-07 23:14:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:53,574 INFO L225 Difference]: With dead ends: 1517 [2025-02-07 23:14:53,575 INFO L226 Difference]: Without dead ends: 805 [2025-02-07 23:14:53,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:53,577 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 147 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:53,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 502 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-02-07 23:14:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 795. [2025-02-07 23:14:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.3904282115869018) internal successors, (1104), 794 states have internal predecessors, (1104), 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-02-07 23:14:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1104 transitions. [2025-02-07 23:14:53,591 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1104 transitions. Word has length 80 [2025-02-07 23:14:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:53,591 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1104 transitions. [2025-02-07 23:14:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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-02-07 23:14:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1104 transitions. [2025-02-07 23:14:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 23:14:53,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:53,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:53,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:14:53,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -166958399, now seen corresponding path program 1 times [2025-02-07 23:14:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:53,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164018238] [2025-02-07 23:14:53,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:53,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 23:14:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 23:14:53,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:14:53,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:14:53,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 23:14:54,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 23:14:54,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:54,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:14:54,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:14:54,161 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:14:54,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:14:54,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:14:54,166 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:54,209 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:14:54,210 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:14:54,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:14:54,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:14:54 BoogieIcfgContainer [2025-02-07 23:14:54,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:14:54,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:14:54,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:14:54,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:14:54,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:26" (3/4) ... [2025-02-07 23:14:54,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:14:54,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:14:54,226 INFO L158 Benchmark]: Toolchain (without parser) took 29278.02ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 132.2MB in the beginning and 544.3MB in the end (delta: -412.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-02-07 23:14:54,226 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 209.7MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:14:54,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.57ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 113.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:14:54,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.05ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 102.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:14:54,227 INFO L158 Benchmark]: Boogie Preprocessor took 81.43ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 95.2MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:14:54,227 INFO L158 Benchmark]: IcfgBuilder took 827.81ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 106.9MB in the end (delta: -11.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2025-02-07 23:14:54,227 INFO L158 Benchmark]: TraceAbstraction took 28010.01ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 106.1MB in the beginning and 544.4MB in the end (delta: -438.3MB). Peak memory consumption was 356.8MB. Max. memory is 16.1GB. [2025-02-07 23:14:54,227 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 637.5MB. Free memory was 544.4MB in the beginning and 544.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:14:54,228 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.31ms. Allocated memory is still 209.7MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.57ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 113.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.05ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 102.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.43ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 95.2MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 827.81ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 106.9MB in the end (delta: -11.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28010.01ms. Allocated memory was 167.8MB in the beginning and 637.5MB in the end (delta: 469.8MB). Free memory was 106.1MB in the beginning and 544.4MB in the end (delta: -438.3MB). Peak memory consumption was 356.8MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 637.5MB. Free memory was 544.4MB in the beginning and 544.3MB in the end (delta: 84.0kB). 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: 21]: 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 bitwiseOr at line 88, overapproximation of bitwiseAnd at line 284, overapproximation of bitwiseAnd at line 93, overapproximation of bitwiseAnd at line 81. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 32); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (32 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (3 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 2); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (2 - 1); [L38] const SORT_1 var_4 = 0; [L39] const SORT_7 var_9 = 1; [L40] const SORT_12 var_13 = 0; [L41] const SORT_1 var_21 = 1; [L42] const SORT_12 var_28 = 2; [L43] const SORT_12 var_31 = 1; [L44] const SORT_12 var_35 = 4; [L45] const SORT_12 var_38 = 6; [L46] const SORT_12 var_41 = 5; [L47] const SORT_12 var_45 = 3; [L48] const SORT_7 var_57 = 0; [L50] SORT_1 input_2; [L51] SORT_1 input_3; [L52] SORT_12 input_55; [L53] SORT_12 input_62; [L54] SORT_12 input_75; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L56] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L57] SORT_12 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_12; [L59] SORT_1 init_6_arg_1 = var_4; [L60] state_5 = init_6_arg_1 [L61] SORT_12 init_15_arg_1 = var_13; [L62] state_14 = init_15_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_16_arg_0=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-256, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND FALSE !(!(cond)) [L96] RET __VERIFIER_assert(!(bad_24_arg_0)) [L98] SORT_12 var_42_arg_0 = state_14; [L99] SORT_12 var_42_arg_1 = var_41; [L100] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L101] SORT_12 var_39_arg_0 = state_14; [L102] SORT_12 var_39_arg_1 = var_38; [L103] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L104] SORT_1 var_43_arg_0 = var_42; [L105] SORT_1 var_43_arg_1 = var_39; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_43_arg_0=0, var_43_arg_1=0, var_45=3, var_4=0, var_57=0, var_9=1] [L106] EXPR var_43_arg_0 | var_43_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L106] SORT_1 var_43 = var_43_arg_0 | var_43_arg_1; [L107] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L107] var_43 = var_43 & mask_SORT_1 [L108] SORT_12 var_36_arg_0 = state_14; [L109] SORT_12 var_36_arg_1 = var_35; [L110] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L111] SORT_12 var_46_arg_0 = state_14; [L112] SORT_12 var_46_arg_1 = var_45; [L113] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L114] SORT_1 var_48_arg_0 = var_36; [L115] SORT_1 var_48_arg_1 = var_46; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_48_arg_0=0, var_48_arg_1=0, var_4=0, var_57=0, var_9=1] [L116] EXPR ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L116] SORT_47 var_48 = ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1; [L117] EXPR var_48 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L117] var_48 = var_48 & mask_SORT_47 [L118] SORT_1 var_49_arg_0 = var_43; [L119] SORT_47 var_49_arg_1 = var_48; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_49_arg_0=0, var_49_arg_1=0, var_4=0, var_57=0, var_9=1] [L120] EXPR ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L120] SORT_12 var_49 = ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1; [L121] EXPR var_49 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L121] var_49 = var_49 & mask_SORT_12 [L122] SORT_12 var_50_arg_0 = var_49; [L123] SORT_1 var_50 = var_50_arg_0 != 0; [L124] SORT_1 var_40_arg_0 = var_39; [L125] SORT_1 var_40_arg_1 = var_4; [L126] SORT_1 var_40_arg_2 = var_4; [L127] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L128] SORT_1 var_37_arg_0 = var_36; [L129] SORT_1 var_37_arg_1 = var_21; [L130] SORT_1 var_37_arg_2 = var_4; [L131] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L132] SORT_1 var_44_arg_0 = var_43; [L133] SORT_1 var_44_arg_1 = var_40; [L134] SORT_1 var_44_arg_2 = var_37; [L135] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L136] SORT_12 var_32_arg_0 = state_14; [L137] SORT_12 var_32_arg_1 = var_31; [L138] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L139] SORT_12 var_29_arg_0 = state_14; [L140] SORT_12 var_29_arg_1 = var_28; [L141] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L142] SORT_1 var_33_arg_0 = var_32; [L143] SORT_1 var_33_arg_1 = var_29; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_33_arg_0=0, var_33_arg_1=0, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] EXPR var_33_arg_0 | var_33_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] SORT_1 var_33 = var_33_arg_0 | var_33_arg_1; [L145] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L145] var_33 = var_33 & mask_SORT_1 [L146] SORT_1 var_30_arg_0 = var_29; [L147] SORT_1 var_30_arg_1 = var_4; [L148] SORT_1 var_30_arg_2 = var_4; [L149] SORT_1 var_30 = var_30_arg_0 ? var_30_arg_1 : var_30_arg_2; [L150] SORT_12 var_26_arg_0 = state_14; [L151] SORT_12 var_26_arg_1 = var_13; [L152] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L153] SORT_1 var_27_arg_0 = var_26; [L154] SORT_1 var_27_arg_1 = var_4; [L155] SORT_1 var_27_arg_2 = state_5; [L156] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L157] SORT_1 var_34_arg_0 = var_33; [L158] SORT_1 var_34_arg_1 = var_30; [L159] SORT_1 var_34_arg_2 = var_27; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_1 var_51_arg_0 = var_50; [L162] SORT_1 var_51_arg_1 = var_44; [L163] SORT_1 var_51_arg_2 = var_34; [L164] SORT_1 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L165] SORT_1 next_52_arg_1 = var_51; [L166] SORT_12 var_83_arg_0 = state_14; [L167] SORT_12 var_83_arg_1 = var_41; [L168] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L169] SORT_12 var_81_arg_0 = state_14; [L170] SORT_12 var_81_arg_1 = var_38; [L171] SORT_1 var_81 = var_81_arg_0 == var_81_arg_1; [L172] SORT_1 var_84_arg_0 = var_83; [L173] SORT_1 var_84_arg_1 = var_81; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_84_arg_0=0, var_84_arg_1=0, var_9=1] [L174] EXPR var_84_arg_0 | var_84_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L174] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L175] EXPR var_84 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L175] var_84 = var_84 & mask_SORT_1 [L176] SORT_12 var_73_arg_0 = state_14; [L177] SORT_12 var_73_arg_1 = var_35; [L178] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L179] SORT_12 var_86_arg_0 = state_14; [L180] SORT_12 var_86_arg_1 = var_45; [L181] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L182] SORT_1 var_87_arg_0 = var_73; [L183] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_87_arg_0=0, var_87_arg_1=0, var_9=1] [L184] EXPR ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L184] SORT_47 var_87 = ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1; [L185] EXPR var_87 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L185] var_87 = var_87 & mask_SORT_47 [L186] SORT_1 var_88_arg_0 = var_84; [L187] SORT_47 var_88_arg_1 = var_87; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_88_arg_0=0, var_88_arg_1=0, var_9=1] [L188] EXPR ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L188] SORT_12 var_88 = ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1; [L189] EXPR var_88 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L189] var_88 = var_88 & mask_SORT_12 [L190] SORT_12 var_89_arg_0 = var_88; [L191] SORT_1 var_89 = var_89_arg_0 != 0; [L192] SORT_12 var_79_arg_0 = state_14; [L193] SORT_12 var_79_arg_1 = var_38; [L194] SORT_1 var_79 = var_79_arg_0 == var_79_arg_1; [L195] SORT_1 var_76_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_76_arg_0=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] EXPR var_76_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] var_76_arg_0 = var_76_arg_0 & mask_SORT_1 [L197] SORT_7 var_76 = var_76_arg_0; [L198] SORT_7 var_77_arg_0 = var_76; [L199] SORT_7 var_77_arg_1 = var_57; [L200] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L201] SORT_1 var_78_arg_0 = var_77; [L202] SORT_12 var_78_arg_1 = var_35; [L203] SORT_12 var_78_arg_2 = var_13; [L204] SORT_12 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_80_arg_0 = var_79; [L206] SORT_12 var_80_arg_1 = var_78; [L207] SORT_12 var_80_arg_2 = input_75; [L208] SORT_12 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L209] SORT_1 var_82_arg_0 = var_81; [L210] SORT_12 var_82_arg_1 = var_80; [L211] SORT_12 var_82_arg_2 = var_38; [L212] SORT_12 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L213] SORT_1 var_74_arg_0 = var_73; [L214] SORT_12 var_74_arg_1 = var_31; [L215] SORT_12 var_74_arg_2 = var_35; [L216] SORT_12 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L217] SORT_1 var_85_arg_0 = var_84; [L218] SORT_12 var_85_arg_1 = var_82; [L219] SORT_12 var_85_arg_2 = var_74; [L220] SORT_12 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L221] SORT_12 var_70_arg_0 = state_14; [L222] SORT_12 var_70_arg_1 = var_31; [L223] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L224] SORT_12 var_68_arg_0 = state_14; [L225] SORT_12 var_68_arg_1 = var_28; [L226] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L227] SORT_1 var_71_arg_0 = var_70; [L228] SORT_1 var_71_arg_1 = var_68; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_71_arg_0=0, var_71_arg_1=0, var_85=4, var_89=0, var_9=1] [L229] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L229] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L230] EXPR var_71 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L230] var_71 = var_71 & mask_SORT_1 [L231] SORT_12 var_66_arg_0 = state_14; [L232] SORT_12 var_66_arg_1 = var_28; [L233] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L234] SORT_1 var_63_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_63_arg_0=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L236] SORT_7 var_63 = var_63_arg_0; [L237] SORT_7 var_64_arg_0 = var_63; [L238] SORT_7 var_64_arg_1 = var_57; [L239] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L240] SORT_1 var_65_arg_0 = var_64; [L241] SORT_12 var_65_arg_1 = var_45; [L242] SORT_12 var_65_arg_2 = var_38; [L243] SORT_12 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L244] SORT_1 var_67_arg_0 = var_66; [L245] SORT_12 var_67_arg_1 = var_65; [L246] SORT_12 var_67_arg_2 = input_62; [L247] SORT_12 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L248] SORT_12 var_60_arg_0 = state_14; [L249] SORT_12 var_60_arg_1 = var_31; [L250] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L251] SORT_1 var_56_arg_0 = input_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_56_arg_0=0, var_57=0, var_60=0, var_67=1, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] EXPR var_56_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_60=0, var_67=1, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] var_56_arg_0 = var_56_arg_0 & mask_SORT_1 [L253] SORT_7 var_56 = var_56_arg_0; [L254] SORT_7 var_58_arg_0 = var_56; [L255] SORT_7 var_58_arg_1 = var_57; [L256] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L257] SORT_1 var_59_arg_0 = var_58; [L258] SORT_12 var_59_arg_1 = var_28; [L259] SORT_12 var_59_arg_2 = var_41; [L260] SORT_12 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L261] SORT_1 var_61_arg_0 = var_60; [L262] SORT_12 var_61_arg_1 = var_59; [L263] SORT_12 var_61_arg_2 = input_55; [L264] SORT_12 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L265] SORT_1 var_69_arg_0 = var_68; [L266] SORT_12 var_69_arg_1 = var_67; [L267] SORT_12 var_69_arg_2 = var_61; [L268] SORT_12 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L269] SORT_12 var_53_arg_0 = state_14; [L270] SORT_12 var_53_arg_1 = var_13; [L271] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L272] SORT_1 var_54_arg_0 = var_53; [L273] SORT_12 var_54_arg_1 = var_31; [L274] SORT_12 var_54_arg_2 = state_14; [L275] SORT_12 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L276] SORT_1 var_72_arg_0 = var_71; [L277] SORT_12 var_72_arg_1 = var_69; [L278] SORT_12 var_72_arg_2 = var_54; [L279] SORT_12 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L280] SORT_1 var_90_arg_0 = var_89; [L281] SORT_12 var_90_arg_1 = var_85; [L282] SORT_12 var_90_arg_2 = var_72; [L283] SORT_12 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_90=1, var_9=1] [L284] EXPR var_90 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L284] var_90 = var_90 & mask_SORT_12 [L285] SORT_12 next_91_arg_1 = var_90; [L287] state_5 = next_52_arg_1 [L288] state_14 = next_91_arg_1 [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_16_arg_0=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6954 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6954 mSDsluCounter, 10551 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8569 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9104 IncrementalHoareTripleChecker+Invalid, 9200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 1982 mSDtfsCounter, 9104 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=795occurred in iteration=17, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 817 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 1186 NumberOfCodeBlocks, 1186 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1240 ConstructedInterpolants, 0 QuantifiedInterpolants, 12819 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2049 ConjunctsInSsa, 311 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 150/182 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-02-07 23:14:54,248 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/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:14:56,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:14:56,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:14:56,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:14:56,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:14:56,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:14:56,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:14:56,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:14:56,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:14:56,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:14:56,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:14:56,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:14:56,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:14:56,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:14:56,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:14:56,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:14:56,103 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2025-02-07 23:14:56,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:14:56,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:14:56,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:14:56,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:14:56,357 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:14:56,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-02-07 23:14:57,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d0dd0cb1/b47ac94aba0b4233b7c4e869621767f4/FLAG234a5f0fc [2025-02-07 23:14:57,790 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:14:57,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-02-07 23:14:57,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d0dd0cb1/b47ac94aba0b4233b7c4e869621767f4/FLAG234a5f0fc [2025-02-07 23:14:57,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d0dd0cb1/b47ac94aba0b4233b7c4e869621767f4 [2025-02-07 23:14:57,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:14:57,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:14:57,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:14:57,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:14:57,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:14:57,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:14:57" (1/1) ... [2025-02-07 23:14:57,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb3bf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:57, skipping insertion in model container [2025-02-07 23:14:57,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:14:57" (1/1) ... [2025-02-07 23:14:57,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:14:57,977 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/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-02-07 23:14:58,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:14:58,067 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:14:58,077 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/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-02-07 23:14:58,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:14:58,126 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:14:58,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58 WrapperNode [2025-02-07 23:14:58,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:14:58,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:14:58,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:14:58,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:14:58,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,180 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 290 [2025-02-07 23:14:58,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:14:58,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:14:58,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:14:58,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:14:58,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,213 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:14:58,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:14:58,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:14:58,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:14:58,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:14:58,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (1/1) ... [2025-02-07 23:14:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:14:58,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:58,270 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-02-07 23:14:58,273 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-02-07 23:14:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:14:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:14:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 23:14:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:14:58,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:14:58,396 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:14:58,397 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:14:58,673 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-07 23:14:58,674 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:14:58,680 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:14:58,680 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:14:58,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:58 BoogieIcfgContainer [2025-02-07 23:14:58,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:14:58,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:14:58,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:14:58,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:14:58,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:14:57" (1/3) ... [2025-02-07 23:14:58,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491fd8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:14:58, skipping insertion in model container [2025-02-07 23:14:58,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:58" (2/3) ... [2025-02-07 23:14:58,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491fd8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:14:58, skipping insertion in model container [2025-02-07 23:14:58,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:58" (3/3) ... [2025-02-07 23:14:58,688 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2025-02-07 23:14:58,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:14:58,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:14:58,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:14:58,735 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;@686983a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:14:58,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:14:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-02-07 23:14:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:14:58,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:58,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:14:58,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:58,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:14:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:14:58,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580792787] [2025-02-07 23:14:58,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:58,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:58,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:58,760 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-02-07 23:14:58,762 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-02-07 23:14:58,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:14:58,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:14:58,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:58,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:58,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 23:14:58,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:14:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:14:59,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:14:59,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:14:59,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580792787] [2025-02-07 23:14:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580792787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:59,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:59,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:14:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664425597] [2025-02-07 23:14:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:14:59,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:59,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:59,060 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 23:14:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:59,112 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:14:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-07 23:14:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:59,119 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:14:59,120 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:14:59,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:59,123 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:59,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:14:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:14:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:14:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-07 23:14:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:14:59,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:14:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:59,140 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:14:59,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 23:14:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:14:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:14:59,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:59,141 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:14:59,148 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-02-07 23:14:59,342 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-02-07 23:14:59,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:59,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:14:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:14:59,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033426598] [2025-02-07 23:14:59,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:59,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:59,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:59,345 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-02-07 23:14:59,346 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-02-07 23:14:59,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:14:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:14:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:59,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:59,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 23:14:59,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:15:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:15:02,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:15:24,886 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 407 DAG size of output: 310 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 23:15:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:15:32,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:15:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033426598] [2025-02-07 23:15:32,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033426598] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:15:32,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:15:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 23:15:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019071375] [2025-02-07 23:15:32,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:15:32,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:15:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:15:32,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:15:32,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:15:32,879 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-02-07 23:15:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:15:32,975 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-07 23:15:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:15:32,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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 7 [2025-02-07 23:15:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:15:32,976 INFO L225 Difference]: With dead ends: 14 [2025-02-07 23:15:32,976 INFO L226 Difference]: Without dead ends: 12 [2025-02-07 23:15:32,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:15:32,977 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:15:32,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:15:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-07 23:15:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-07 23:15:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-07 23:15:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:15:32,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:15:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:15:32,979 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:15:32,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-02-07 23:15:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:15:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:15:32,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:15:32,979 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:15:32,985 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-02-07 23:15:33,179 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-02-07 23:15:33,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:15:33,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:15:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:15:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:15:33,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127218141] [2025-02-07 23:15:33,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:15:33,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:15:33,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:15:33,184 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-02-07 23:15:33,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 23:15:33,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 23:15:33,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:15:33,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:15:33,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:15:33,299 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-07 23:15:33,306 INFO L279 TraceCheckSpWp]: Computing forward predicates...