./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_b04.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 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:14:59,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:14:59,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:14:59,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:14:59,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:14:59,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:14:59,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:14:59,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:14:59,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:14:59,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:14:59,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:14:59,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:14:59,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:14:59,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:14:59,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:14:59,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:14:59,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:14:59,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:14:59,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:14:59,795 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 -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2025-02-05 19:15:00,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:15:00,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:15:00,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:15:00,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:15:00,065 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:15:00,066 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_b04.c [2025-02-05 19:15:01,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b5adff2d/b8b92d4c9dcd48dc949a4f098556148a/FLAG85e6ef06c [2025-02-05 19:15:01,391 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:15:01,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2025-02-05 19:15:01,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b5adff2d/b8b92d4c9dcd48dc949a4f098556148a/FLAG85e6ef06c [2025-02-05 19:15:01,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b5adff2d/b8b92d4c9dcd48dc949a4f098556148a [2025-02-05 19:15:01,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:15:01,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:15:01,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:15:01,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:15:01,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:15:01,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:01,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e52473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01, skipping insertion in model container [2025-02-05 19:15:01,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:01,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:15:01,860 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_b04.c[1245,1258] [2025-02-05 19:15:01,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:15:01,901 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:15:01,909 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_b04.c[1245,1258] [2025-02-05 19:15:01,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:15:01,945 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:15:01,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01 WrapperNode [2025-02-05 19:15:01,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:15:01,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:15:01,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:15:01,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:15:01,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:01,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:01,978 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 215 [2025-02-05 19:15:01,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:15:01,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:15:01,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:15:01,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:15:01,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:01,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:01,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,007 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-05 19:15:02,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:15:02,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:15:02,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:15:02,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:15:02,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (1/1) ... [2025-02-05 19:15:02,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:15:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:02,047 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-05 19:15:02,049 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-05 19:15:02,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:15:02,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:15:02,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 19:15:02,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:15:02,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:15:02,119 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:15:02,121 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:15:02,398 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-05 19:15:02,398 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:15:02,417 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:15:02,418 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:15:02,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:15:02 BoogieIcfgContainer [2025-02-05 19:15:02,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:15:02,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:15:02,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:15:02,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:15:02,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:15:01" (1/3) ... [2025-02-05 19:15:02,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea407da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:15:02, skipping insertion in model container [2025-02-05 19:15:02,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:01" (2/3) ... [2025-02-05 19:15:02,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea407da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:15:02, skipping insertion in model container [2025-02-05 19:15:02,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:15:02" (3/3) ... [2025-02-05 19:15:02,425 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2025-02-05 19:15:02,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:15:02,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b04.c that has 1 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:15:02,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:15:02,481 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;@78fc8388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:15:02,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:15:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 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-05 19:15:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 19:15:02,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:02,489 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-05 19:15:02,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:02,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1974569809, now seen corresponding path program 1 times [2025-02-05 19:15:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:02,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984169167] [2025-02-05 19:15:02,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:02,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 19:15:02,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 19:15:02,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:02,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:02,930 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-05 19:15:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984169167] [2025-02-05 19:15:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984169167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:15:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814561892] [2025-02-05 19:15:02,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:15:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:02,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:15:02,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:15:02,950 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 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 5.25) internal successors, (21), 4 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-05 19:15:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:03,001 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2025-02-05 19:15:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:15:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-05 19:15:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:03,008 INFO L225 Difference]: With dead ends: 77 [2025-02-05 19:15:03,008 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 19:15:03,010 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-05 19:15:03,011 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:03,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 19:15:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-05 19:15:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 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-05 19:15:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2025-02-05 19:15:03,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 21 [2025-02-05 19:15:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:03,042 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2025-02-05 19:15:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-05 19:15:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2025-02-05 19:15:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 19:15:03,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:03,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:03,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:15:03,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:03,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1077442783, now seen corresponding path program 1 times [2025-02-05 19:15:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300063751] [2025-02-05 19:15:03,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:03,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 19:15:03,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 19:15:03,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:03,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:03,196 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-05 19:15:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:03,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300063751] [2025-02-05 19:15:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300063751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:03,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:15:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435961218] [2025-02-05 19:15:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:03,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:15:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:03,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:15:03,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:15:03,199 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.5) 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-05 19:15:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:03,245 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2025-02-05 19:15:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:15:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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-05 19:15:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:03,248 INFO L225 Difference]: With dead ends: 78 [2025-02-05 19:15:03,248 INFO L226 Difference]: Without dead ends: 47 [2025-02-05 19:15:03,249 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-05 19:15:03,250 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:03,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-05 19:15:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-05 19:15:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 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-05 19:15:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2025-02-05 19:15:03,257 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 22 [2025-02-05 19:15:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:03,257 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2025-02-05 19:15:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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-05 19:15:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2025-02-05 19:15:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 19:15:03,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:03,257 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-05 19:15:03,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:15:03,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:03,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1404445974, now seen corresponding path program 1 times [2025-02-05 19:15:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:03,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80433300] [2025-02-05 19:15:03,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:03,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 19:15:03,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 19:15:03,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:03,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:03,529 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-05 19:15:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80433300] [2025-02-05 19:15:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80433300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:15:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130303896] [2025-02-05 19:15:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:03,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:15:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:03,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:15:03,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:15:03,530 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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-05 19:15:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:03,575 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2025-02-05 19:15:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:15:03,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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-05 19:15:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:03,576 INFO L225 Difference]: With dead ends: 80 [2025-02-05 19:15:03,576 INFO L226 Difference]: Without dead ends: 47 [2025-02-05 19:15:03,576 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-05 19:15:03,576 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:03,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-05 19:15:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-05 19:15:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 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-05 19:15:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2025-02-05 19:15:03,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 23 [2025-02-05 19:15:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:03,580 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-02-05 19:15:03,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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-05 19:15:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2025-02-05 19:15:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 19:15:03,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:03,580 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, 1] [2025-02-05 19:15:03,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:15:03,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:03,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1300210278, now seen corresponding path program 1 times [2025-02-05 19:15:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677609167] [2025-02-05 19:15:03,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:03,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 19:15:03,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 19:15:03,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:03,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:03,853 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-05 19:15:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677609167] [2025-02-05 19:15:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677609167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:03,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:15:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445564873] [2025-02-05 19:15:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:15:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:03,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:15:03,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:15:03,854 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-05 19:15:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:03,952 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-05 19:15:03,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:15:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 24 [2025-02-05 19:15:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:03,953 INFO L225 Difference]: With dead ends: 90 [2025-02-05 19:15:03,953 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 19:15:03,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-05 19:15:03,954 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:03,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 258 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:15:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 19:15:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-02-05 19:15:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 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-05 19:15:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-02-05 19:15:03,960 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 24 [2025-02-05 19:15:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:03,960 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-02-05 19:15:03,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-05 19:15:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-02-05 19:15:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 19:15:03,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:03,961 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, 1, 1] [2025-02-05 19:15:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:15:03,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1693079776, now seen corresponding path program 1 times [2025-02-05 19:15:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321617710] [2025-02-05 19:15:03,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:03,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 19:15:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 19:15:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:04,132 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-05 19:15:04,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:04,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321617710] [2025-02-05 19:15:04,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321617710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:04,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102068033] [2025-02-05 19:15:04,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:04,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:04,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:04,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:04,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:04,135 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-05 19:15:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:04,245 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2025-02-05 19:15:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:04,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 19:15:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:04,246 INFO L225 Difference]: With dead ends: 136 [2025-02-05 19:15:04,246 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 19:15:04,246 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-05 19:15:04,246 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:04,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 102 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:15:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 19:15:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 59. [2025-02-05 19:15:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 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-05 19:15:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2025-02-05 19:15:04,254 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 25 [2025-02-05 19:15:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:04,254 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2025-02-05 19:15:04,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-05 19:15:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2025-02-05 19:15:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 19:15:04,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:04,255 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, 1, 1] [2025-02-05 19:15:04,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:15:04,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:04,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1512516036, now seen corresponding path program 1 times [2025-02-05 19:15:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248351639] [2025-02-05 19:15:04,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 19:15:04,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 19:15:04,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:04,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:04,483 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-05 19:15:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248351639] [2025-02-05 19:15:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248351639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154733797] [2025-02-05 19:15:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:04,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:04,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:04,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:04,486 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-05 19:15:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:04,534 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2025-02-05 19:15:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 19:15:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:04,535 INFO L225 Difference]: With dead ends: 107 [2025-02-05 19:15:04,535 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 19:15:04,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-05 19:15:04,536 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 51 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:04,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 135 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 19:15:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-05 19:15:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 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-05 19:15:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-02-05 19:15:04,544 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 25 [2025-02-05 19:15:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:04,545 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-02-05 19:15:04,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-05 19:15:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-02-05 19:15:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 19:15:04,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:04,545 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, 1, 1, 1] [2025-02-05 19:15:04,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:15:04,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:04,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1817295986, now seen corresponding path program 1 times [2025-02-05 19:15:04,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:04,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350116208] [2025-02-05 19:15:04,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:04,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 19:15:04,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 19:15:04,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:04,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:04,715 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-05 19:15:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350116208] [2025-02-05 19:15:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350116208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534171680] [2025-02-05 19:15:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:04,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:04,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:04,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:04,716 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:04,771 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2025-02-05 19:15:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:04,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 19:15:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:04,772 INFO L225 Difference]: With dead ends: 143 [2025-02-05 19:15:04,772 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 19:15:04,773 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-05 19:15:04,774 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:04,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 167 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 19:15:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 64. [2025-02-05 19:15:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 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-05 19:15:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2025-02-05 19:15:04,782 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 26 [2025-02-05 19:15:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-02-05 19:15:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2025-02-05 19:15:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 19:15:04,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:04,783 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, 1, 1, 1] [2025-02-05 19:15:04,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:15:04,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1016116829, now seen corresponding path program 1 times [2025-02-05 19:15:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834159637] [2025-02-05 19:15:04,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:04,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 19:15:04,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 19:15:04,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:04,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:04,954 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-05 19:15:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834159637] [2025-02-05 19:15:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834159637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:04,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:04,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:15:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884630640] [2025-02-05 19:15:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:04,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:04,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:04,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:04,956 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:05,044 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2025-02-05 19:15:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:05,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 19:15:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:05,045 INFO L225 Difference]: With dead ends: 124 [2025-02-05 19:15:05,045 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 19:15:05,048 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-05 19:15:05,048 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:05,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:15:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 19:15:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2025-02-05 19:15:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 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-05 19:15:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-02-05 19:15:05,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 26 [2025-02-05 19:15:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:05,051 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-02-05 19:15:05,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-02-05 19:15:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 19:15:05,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:05,052 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] [2025-02-05 19:15:05,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 19:15:05,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:05,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1324804694, now seen corresponding path program 1 times [2025-02-05 19:15:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377867641] [2025-02-05 19:15:05,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:05,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 19:15:05,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 19:15:05,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:05,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:05,282 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-05 19:15:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377867641] [2025-02-05 19:15:05,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377867641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:15:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982402934] [2025-02-05 19:15:05,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:05,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:05,287 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-05 19:15:05,288 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-05 19:15:05,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 19:15:05,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 19:15:05,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:05,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:05,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 19:15:05,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:05,569 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-05 19:15:05,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:15:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982402934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 19:15:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-02-05 19:15:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414139846] [2025-02-05 19:15:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:05,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:15:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:05,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:15:05,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:15:05,573 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-05 19:15:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:05,663 INFO L93 Difference]: Finished difference Result 126 states and 162 transitions. [2025-02-05 19:15:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:15:05,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2025-02-05 19:15:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:05,665 INFO L225 Difference]: With dead ends: 126 [2025-02-05 19:15:05,665 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 19:15:05,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:15:05,665 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:05,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 81 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:15:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 19:15:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 19:15:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 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-05 19:15:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2025-02-05 19:15:05,670 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 41 [2025-02-05 19:15:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:05,670 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2025-02-05 19:15:05,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-05 19:15:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2025-02-05 19:15:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 19:15:05,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:05,671 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] [2025-02-05 19:15:05,678 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-05 19:15:05,875 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-05 19:15:05,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:05,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1112853758, now seen corresponding path program 1 times [2025-02-05 19:15:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128299228] [2025-02-05 19:15:05,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:05,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 19:15:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 19:15:05,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:05,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:06,256 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-05 19:15:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128299228] [2025-02-05 19:15:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128299228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:15:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101099672] [2025-02-05 19:15:06,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:06,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:06,259 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-05 19:15:06,260 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-05 19:15:06,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 19:15:06,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 19:15:06,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:06,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:06,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 19:15:06,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:06,542 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-05 19:15:06,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:06,848 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-05 19:15:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101099672] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:06,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:15:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-02-05 19:15:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439653777] [2025-02-05 19:15:06,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 19:15:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:06,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 19:15:06,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-02-05 19:15:06,850 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 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-05 19:15:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:07,078 INFO L93 Difference]: Finished difference Result 159 states and 201 transitions. [2025-02-05 19:15:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:15:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 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 42 [2025-02-05 19:15:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:07,079 INFO L225 Difference]: With dead ends: 159 [2025-02-05 19:15:07,079 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 19:15:07,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-02-05 19:15:07,080 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:07,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 289 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 19:15:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2025-02-05 19:15:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 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-05 19:15:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2025-02-05 19:15:07,083 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 42 [2025-02-05 19:15:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2025-02-05 19:15:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 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-05 19:15:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2025-02-05 19:15:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 19:15:07,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:07,084 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] [2025-02-05 19:15:07,091 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-05 19:15:07,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:07,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:07,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2100710463, now seen corresponding path program 1 times [2025-02-05 19:15:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:07,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022642420] [2025-02-05 19:15:07,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:07,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 19:15:07,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 19:15:07,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:07,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:08,044 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-05 19:15:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022642420] [2025-02-05 19:15:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022642420] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:15:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792808227] [2025-02-05 19:15:08,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:08,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:08,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:08,047 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-05 19:15:08,048 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-05 19:15:08,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 19:15:08,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 19:15:08,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:08,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:08,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-05 19:15:08,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:08,532 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-05 19:15:08,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:09,681 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-05 19:15:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792808227] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:09,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:15:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2025-02-05 19:15:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63527656] [2025-02-05 19:15:09,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 19:15:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:09,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 19:15:09,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-02-05 19:15:09,683 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 26 states have internal predecessors, (113), 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-05 19:15:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:10,083 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2025-02-05 19:15:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 19:15:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 26 states have internal predecessors, (113), 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 43 [2025-02-05 19:15:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:10,084 INFO L225 Difference]: With dead ends: 134 [2025-02-05 19:15:10,084 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 19:15:10,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 19:15:10,085 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:10,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 197 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 19:15:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-02-05 19:15:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 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-05 19:15:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2025-02-05 19:15:10,088 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2025-02-05 19:15:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:10,088 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2025-02-05 19:15:10,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 26 states have internal predecessors, (113), 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-05 19:15:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2025-02-05 19:15:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 19:15:10,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:10,089 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] [2025-02-05 19:15:10,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 19:15:10,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:10,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:10,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1063541693, now seen corresponding path program 1 times [2025-02-05 19:15:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575173920] [2025-02-05 19:15:10,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:10,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 19:15:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 19:15:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:10,591 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-05 19:15:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575173920] [2025-02-05 19:15:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575173920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:15:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259053245] [2025-02-05 19:15:10,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:10,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 19:15:10,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 19:15:10,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 19:15:10,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 19:15:10,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:10,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:10,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 19:15:10,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:10,827 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-05 19:15:10,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:11,065 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-05 19:15:11,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259053245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:11,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:15:11,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-02-05 19:15:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832866857] [2025-02-05 19:15:11,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:11,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 19:15:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:11,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 19:15:11,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-02-05 19:15:11,066 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 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-05 19:15:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:11,315 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2025-02-05 19:15:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:15:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 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 44 [2025-02-05 19:15:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:11,316 INFO L225 Difference]: With dead ends: 149 [2025-02-05 19:15:11,316 INFO L226 Difference]: Without dead ends: 97 [2025-02-05 19:15:11,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-02-05 19:15:11,317 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 46 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:11,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 452 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:15:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-05 19:15:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-02-05 19:15:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 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-05 19:15:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-02-05 19:15:11,323 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 44 [2025-02-05 19:15:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:11,324 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-02-05 19:15:11,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 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-05 19:15:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-02-05 19:15:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 19:15:11,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:11,325 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 19:15:11,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 19:15:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 19:15:11,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 412783668, now seen corresponding path program 1 times [2025-02-05 19:15:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500102291] [2025-02-05 19:15:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:11,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 19:15:11,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 19:15:11,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:11,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:12,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500102291] [2025-02-05 19:15:12,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500102291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:15:12,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959917786] [2025-02-05 19:15:12,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:12,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 19:15:12,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 19:15:12,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 19:15:12,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 19:15:12,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:12,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-05 19:15:12,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:12,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959917786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:13,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:15:13,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 33 [2025-02-05 19:15:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815035644] [2025-02-05 19:15:13,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:13,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 19:15:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:13,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 19:15:13,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 19:15:13,589 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 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-05 19:15:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:14,956 INFO L93 Difference]: Finished difference Result 216 states and 269 transitions. [2025-02-05 19:15:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 19:15:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 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 58 [2025-02-05 19:15:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:14,958 INFO L225 Difference]: With dead ends: 216 [2025-02-05 19:15:14,958 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 19:15:14,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=542, Invalid=4014, Unknown=0, NotChecked=0, Total=4556 [2025-02-05 19:15:14,960 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 252 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:14,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 769 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:15:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 19:15:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 82. [2025-02-05 19:15:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 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-05 19:15:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2025-02-05 19:15:14,963 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 58 [2025-02-05 19:15:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:14,963 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2025-02-05 19:15:14,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 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-05 19:15:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2025-02-05 19:15:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 19:15:14,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:14,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 19:15:14,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 19:15:15,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 19:15:15,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:15,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:15,165 INFO L85 PathProgramCache]: Analyzing trace with hash 611189271, now seen corresponding path program 1 times [2025-02-05 19:15:15,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:15,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157386011] [2025-02-05 19:15:15,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:15,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:15,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 19:15:15,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 19:15:15,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:15,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 19:15:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:15:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157386011] [2025-02-05 19:15:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157386011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:15:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328564797] [2025-02-05 19:15:15,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:15,531 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 19:15:15,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 19:15:15,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 19:15:15,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 19:15:15,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:15,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:15,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-05 19:15:15,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 19:15:15,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 19:15:16,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328564797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:16,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 19:15:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 11] total 21 [2025-02-05 19:15:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565596193] [2025-02-05 19:15:16,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:16,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 19:15:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:15:16,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 19:15:16,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-02-05 19:15:16,274 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 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-05 19:15:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:16,849 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2025-02-05 19:15:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 19:15:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 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 59 [2025-02-05 19:15:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:16,850 INFO L225 Difference]: With dead ends: 181 [2025-02-05 19:15:16,850 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 19:15:16,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 19:15:16,851 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:16,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 437 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 19:15:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 19:15:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2025-02-05 19:15:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 84 states have internal predecessors, (102), 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-05 19:15:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2025-02-05 19:15:16,855 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 59 [2025-02-05 19:15:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:16,856 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2025-02-05 19:15:16,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 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-05 19:15:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2025-02-05 19:15:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 19:15:16,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:16,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 19:15:16,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 19:15:17,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 19:15:17,057 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1397330773, now seen corresponding path program 1 times [2025-02-05 19:15:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:15:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870486182] [2025-02-05 19:15:17,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:15:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 19:15:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 19:15:17,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:15:17,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 19:15:17,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 19:15:17,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 19:15:17,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:17,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:15:17,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 19:15:17,213 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 19:15:17,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 19:15:17,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 19:15:17,218 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:17,246 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:15:17,246 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:15:17,246 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:15:17,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 19:15:17,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 07:15:17 BoogieIcfgContainer [2025-02-05 19:15:17,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 19:15:17,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 19:15:17,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 19:15:17,263 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 19:15:17,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:15:02" (3/4) ... [2025-02-05 19:15:17,265 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 19:15:17,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 19:15:17,267 INFO L158 Benchmark]: Toolchain (without parser) took 15527.87ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 114.6MB in the beginning and 244.1MB in the end (delta: -129.5MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2025-02-05 19:15:17,267 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:15:17,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.21ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 102.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:15:17,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.22ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 97.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:15:17,268 INFO L158 Benchmark]: Boogie Preprocessor took 44.50ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:15:17,268 INFO L158 Benchmark]: IcfgBuilder took 394.54ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 67.2MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 19:15:17,268 INFO L158 Benchmark]: TraceAbstraction took 14841.92ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 67.2MB in the beginning and 244.2MB in the end (delta: -177.0MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2025-02-05 19:15:17,269 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 419.4MB. Free memory was 244.2MB in the beginning and 244.1MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:15:17,271 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.65ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.21ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 102.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.22ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 97.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.50ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 94.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 394.54ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 67.2MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14841.92ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 67.2MB in the beginning and 244.2MB in the end (delta: -177.0MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 419.4MB. Free memory was 244.2MB in the beginning and 244.1MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. 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 97. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 32); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (32 - 1); [L35] const SORT_4 var_8 = 0; [L36] const SORT_12 var_14 = 1; [L37] const SORT_1 var_25 = 1; [L38] const SORT_1 var_42 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_4 input_5; [L43] SORT_1 input_6; [L44] SORT_1 input_7; [L45] SORT_4 input_29; [L46] SORT_4 input_31; [L47] SORT_4 input_33; [L48] SORT_4 input_35; [L49] SORT_4 input_37; [L50] SORT_4 input_39; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, var_14=1, var_25=1, var_42=0, var_8=0] [L52] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L53] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L54] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_4 init_10_arg_1 = var_8; [L57] state_9 = init_10_arg_1 [L58] SORT_4 init_18_arg_1 = var_8; [L59] state_17 = init_18_arg_1 [L60] SORT_1 init_44_arg_1 = var_42; [L61] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0, var_49=1] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0, var_49=0] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_13_arg_0=1, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_20_arg_0=1, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_22_arg_0=-2, var_22_arg_1=1, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-255, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 811 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 3416 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2852 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3942 IncrementalHoareTripleChecker+Invalid, 3977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 564 mSDtfsCounter, 3942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 502 SyntacticMatches, 3 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=12, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 248 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 8358 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1981 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 296/395 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-05 19:15:17,288 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_b04.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 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:15:19,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:15:19,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 19:15:19,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:15:19,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:15:19,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:15:19,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:15:19,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:15:19,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:15:19,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:15:19,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:15:19,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:15:19,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:15:19,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:15:19,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:15:19,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:15:19,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:15:19,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:15:19,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:15:19,322 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 -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2025-02-05 19:15:19,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:15:19,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:15:19,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:15:19,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:15:19,595 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:15:19,596 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_b04.c [2025-02-05 19:15:20,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f8c22194/052edfeac6944d04a35e95e02e3eb03b/FLAG9002b6722 [2025-02-05 19:15:21,016 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:15:21,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2025-02-05 19:15:21,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f8c22194/052edfeac6944d04a35e95e02e3eb03b/FLAG9002b6722 [2025-02-05 19:15:21,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f8c22194/052edfeac6944d04a35e95e02e3eb03b [2025-02-05 19:15:21,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:15:21,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:15:21,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:15:21,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:15:21,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:15:21,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2112f4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21, skipping insertion in model container [2025-02-05 19:15:21,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:15:21,510 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_b04.c[1245,1258] [2025-02-05 19:15:21,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:15:21,550 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:15:21,559 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_b04.c[1245,1258] [2025-02-05 19:15:21,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:15:21,590 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:15:21,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21 WrapperNode [2025-02-05 19:15:21,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:15:21,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:15:21,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:15:21,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:15:21,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,626 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2025-02-05 19:15:21,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:15:21,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:15:21,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:15:21,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:15:21,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,650 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-05 19:15:21,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:15:21,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:15:21,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:15:21,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:15:21,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (1/1) ... [2025-02-05 19:15:21,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:15:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:21,688 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-05 19:15:21,692 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-05 19:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 19:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 19:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:15:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:15:21,776 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:15:21,778 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:15:21,962 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-05 19:15:21,963 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:15:21,969 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:15:21,969 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:15:21,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:15:21 BoogieIcfgContainer [2025-02-05 19:15:21,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:15:21,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:15:21,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:15:21,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:15:21,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:15:21" (1/3) ... [2025-02-05 19:15:21,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583f79dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:15:21, skipping insertion in model container [2025-02-05 19:15:21,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:15:21" (2/3) ... [2025-02-05 19:15:21,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583f79dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:15:21, skipping insertion in model container [2025-02-05 19:15:21,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:15:21" (3/3) ... [2025-02-05 19:15:21,980 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2025-02-05 19:15:21,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:15:21,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b04.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:15:22,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:15:22,039 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;@2cef93c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:15:22,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:15:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-05 19:15:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 19:15:22,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:22,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 19:15:22,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:22,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 19:15:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:15:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910427439] [2025-02-05 19:15:22,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:22,080 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-05 19:15:22,082 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-05 19:15:22,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 19:15:22,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 19:15:22,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:22,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:22,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 19:15:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:22,450 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-05 19:15:22,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:15:22,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:15:22,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910427439] [2025-02-05 19:15:22,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910427439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:15:22,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:15:22,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:15:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168116125] [2025-02-05 19:15:22,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:15:22,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:15:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:15:22,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:15:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:15:22,470 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-05 19:15:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:22,511 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 19:15:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:15:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-02-05 19:15:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:22,517 INFO L225 Difference]: With dead ends: 18 [2025-02-05 19:15:22,517 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 19:15:22,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:15:22,523 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-05 19:15:22,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 19:15:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 19:15:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-05 19:15:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 19:15:22,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 19:15:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:22,546 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 19:15:22,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-05 19:15:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 19:15:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 19:15:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:22,547 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 19:15:22,555 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-05 19:15:22,748 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-05 19:15:22,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:22,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 19:15:22,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:15:22,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695399716] [2025-02-05 19:15:22,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:15:22,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:22,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:22,754 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-05 19:15:22,756 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-05 19:15:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 19:15:22,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 19:15:22,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:15:22,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:22,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 19:15:22,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:23,066 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-05 19:15:23,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:23,346 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-05 19:15:23,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:15:23,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695399716] [2025-02-05 19:15:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695399716] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:23,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 19:15:23,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 19:15:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454761049] [2025-02-05 19:15:23,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:23,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:15:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:15:23,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:15:23,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:15:23,348 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:23,421 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-05 19:15:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:15:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 19:15:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:23,422 INFO L225 Difference]: With dead ends: 15 [2025-02-05 19:15:23,422 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 19:15:23,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:15:23,423 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:23,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 19:15:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-05 19:15:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-05 19:15:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 19:15:23,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 19:15:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:23,426 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 19:15:23,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:15:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 19:15:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 19:15:23,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:15:23,426 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 19:15:23,433 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-05 19:15:23,631 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-05 19:15:23,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:15:23,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:15:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 19:15:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:15:23,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218947254] [2025-02-05 19:15:23,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 19:15:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:15:23,634 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-05 19:15:23,635 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-05 19:15:23,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 19:15:23,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 19:15:23,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 19:15:23,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:15:23,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 19:15:23,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:15:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:23,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:15:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:15:24,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:15:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218947254] [2025-02-05 19:15:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218947254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:15:24,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 19:15:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 19:15:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942682315] [2025-02-05 19:15:24,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 19:15:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:15:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:15:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:15:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:15:24,271 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-05 19:15:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:15:24,411 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-05 19:15:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:15:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 11 [2025-02-05 19:15:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:15:24,412 INFO L225 Difference]: With dead ends: 13 [2025-02-05 19:15:24,413 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 19:15:24,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:15:24,413 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:15:24,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:15:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 19:15:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 19:15:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-05 19:15:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 19:15:24,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-02-05 19:15:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:15:24,416 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 19:15:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-05 19:15:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 19:15:24,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 19:15:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 19:15:24,426 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-05 19:15:24,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:15:24,622 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-02-05 19:15:24,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 19:15:24,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 19:15:24,660 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-05 19:15:24,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 07:15:24 BoogieIcfgContainer [2025-02-05 19:15:24,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 19:15:24,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 19:15:24,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 19:15:24,664 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 19:15:24,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:15:21" (3/4) ... [2025-02-05 19:15:24,666 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 19:15:24,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-05 19:15:24,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-05 19:15:24,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 19:15:24,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 19:15:24,674 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 19:15:24,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 19:15:24,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 19:15:24,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 19:15:24,736 INFO L158 Benchmark]: Toolchain (without parser) took 3358.52ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 75.0MB in the beginning and 65.1MB in the end (delta: 9.9MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-02-05 19:15:24,736 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:15:24,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.62ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 61.6MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 19:15:24,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.80ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 60.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:15:24,737 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 100.7MB. Free memory was 60.1MB in the beginning and 58.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:15:24,737 INFO L158 Benchmark]: IcfgBuilder took 312.55ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 43.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 19:15:24,737 INFO L158 Benchmark]: TraceAbstraction took 2690.12ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 42.6MB in the beginning and 71.5MB in the end (delta: -28.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-02-05 19:15:24,737 INFO L158 Benchmark]: Witness Printer took 71.52ms. Allocated memory is still 159.4MB. Free memory was 71.5MB in the beginning and 65.1MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:15:24,738 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.27ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.62ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 61.6MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.80ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 60.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 100.7MB. Free memory was 60.1MB in the beginning and 58.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.55ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 43.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2690.12ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 42.6MB in the beginning and 71.5MB in the end (delta: -28.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 71.52ms. Allocated memory is still 159.4MB. Free memory was 71.5MB in the beginning and 65.1MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 12 QuantifiedInterpolants, 855 SizeOfPredicates, 17 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Location Invariant Derived location invariant: ((1 == var_14) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2025-02-05 19:15:24,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE