./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:22:46,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:22:46,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:22:46,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:22:46,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:22:46,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:22:46,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:22:46,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:22:46,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:22:46,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:22:46,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:22:46,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:22:46,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:22:46,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:22:46,565 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:22:46,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:22:46,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:22:46,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:22:46,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:22:46,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:22:46,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:22:46,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:22:46,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:22:46,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:22:46,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:22:46,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:22:46,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:22:46,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:22:46,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:22:46,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:22:46,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:22:46,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:22:46,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:22:46,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:22:46,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:22:46,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:22:46,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:22:46,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:22:46,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:22:46,569 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2025-01-09 07:22:46,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:22:46,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:22:46,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:22:46,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:22:46,874 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:22:46,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-01-09 07:22:48,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/591b7f141/3e0eaced9018450f8ca99b53ba5ff5ff/FLAGfc25f3e90 [2025-01-09 07:22:48,558 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:22:48,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-01-09 07:22:48,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/591b7f141/3e0eaced9018450f8ca99b53ba5ff5ff/FLAGfc25f3e90 [2025-01-09 07:22:48,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/591b7f141/3e0eaced9018450f8ca99b53ba5ff5ff [2025-01-09 07:22:48,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:22:48,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:22:48,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:22:48,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:22:48,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:22:48,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:48,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4294bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48, skipping insertion in model container [2025-01-09 07:22:48,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:48,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:22:48,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-01-09 07:22:48,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:22:48,874 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:22:48,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-01-09 07:22:48,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:22:48,974 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:22:48,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48 WrapperNode [2025-01-09 07:22:48,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:22:48,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:22:48,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:22:48,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:22:48,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,089 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2025-01-09 07:22:49,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:22:49,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:22:49,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:22:49,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:22:49,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,161 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-01-09 07:22:49,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:22:49,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:22:49,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:22:49,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:22:49,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (1/1) ... [2025-01-09 07:22:49,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:22:49,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:22:49,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:22:49,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:22:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:22:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:22:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 07:22:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:22:49,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:22:49,434 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:22:49,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:22:50,219 INFO L? ?]: Removed 307 outVars from TransFormulas that were not future-live. [2025-01-09 07:22:50,220 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:22:50,233 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:22:50,234 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:22:50,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:22:50 BoogieIcfgContainer [2025-01-09 07:22:50,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:22:50,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:22:50,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:22:50,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:22:50,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:22:48" (1/3) ... [2025-01-09 07:22:50,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873ae94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:22:50, skipping insertion in model container [2025-01-09 07:22:50,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:48" (2/3) ... [2025-01-09 07:22:50,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3873ae94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:22:50, skipping insertion in model container [2025-01-09 07:22:50,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:22:50" (3/3) ... [2025-01-09 07:22:50,246 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2025-01-09 07:22:50,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:22:50,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:22:50,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:22:50,330 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;@70fb4005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:22:50,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:22:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 07:22:50,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:50,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:22:50,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:50,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1610079203, now seen corresponding path program 1 times [2025-01-09 07:22:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:50,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780218040] [2025-01-09 07:22:50,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:50,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 07:22:50,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 07:22:50,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:50,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780218040] [2025-01-09 07:22:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780218040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:22:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495607586] [2025-01-09 07:22:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:50,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:22:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:50,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:22:50,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:22:50,967 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:51,017 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2025-01-09 07:22:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:22:51,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 07:22:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:51,025 INFO L225 Difference]: With dead ends: 225 [2025-01-09 07:22:51,026 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 07:22:51,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:22:51,030 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:51,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:22:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 07:22:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 07:22:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-01-09 07:22:51,066 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 19 [2025-01-09 07:22:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:51,067 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-01-09 07:22:51,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-01-09 07:22:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 07:22:51,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:51,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:22:51,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:22:51,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1628847503, now seen corresponding path program 1 times [2025-01-09 07:22:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321822794] [2025-01-09 07:22:51,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:51,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 07:22:51,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 07:22:51,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321822794] [2025-01-09 07:22:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321822794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:51,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:51,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:22:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984113765] [2025-01-09 07:22:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:51,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:22:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:51,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:22:51,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:22:51,260 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:51,318 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2025-01-09 07:22:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:22:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 07:22:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:51,319 INFO L225 Difference]: With dead ends: 226 [2025-01-09 07:22:51,320 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 07:22:51,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:22:51,321 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:51,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:22:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 07:22:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 07:22:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-01-09 07:22:51,335 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 20 [2025-01-09 07:22:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:51,335 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-01-09 07:22:51,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-01-09 07:22:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 07:22:51,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:51,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:22:51,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:22:51,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:51,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2143300810, now seen corresponding path program 1 times [2025-01-09 07:22:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427188349] [2025-01-09 07:22:51,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 07:22:51,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 07:22:51,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:51,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:51,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:51,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427188349] [2025-01-09 07:22:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427188349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:51,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:51,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:22:51,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600025129] [2025-01-09 07:22:51,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:51,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:22:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:51,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:22:51,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:22:51,685 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-01-09 07:22:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:51,757 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2025-01-09 07:22:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:22:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-01-09 07:22:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:51,758 INFO L225 Difference]: With dead ends: 232 [2025-01-09 07:22:51,758 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 07:22:51,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:22:51,759 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 162 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:51,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 628 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:22:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 07:22:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-01-09 07:22:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 121 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2025-01-09 07:22:51,771 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 21 [2025-01-09 07:22:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:51,771 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2025-01-09 07:22:51,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-01-09 07:22:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2025-01-09 07:22:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 07:22:51,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:51,772 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-01-09 07:22:51,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:22:51,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash -453270478, now seen corresponding path program 1 times [2025-01-09 07:22:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327749373] [2025-01-09 07:22:51,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:51,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 07:22:51,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 07:22:51,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:51,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327749373] [2025-01-09 07:22:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327749373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:52,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:22:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149266473] [2025-01-09 07:22:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:52,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:22:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:52,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:22:52,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:22:52,069 INFO L87 Difference]: Start difference. First operand 122 states and 176 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-01-09 07:22:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:52,091 INFO L93 Difference]: Finished difference Result 231 states and 335 transitions. [2025-01-09 07:22:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:22:52,092 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-01-09 07:22:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:52,093 INFO L225 Difference]: With dead ends: 231 [2025-01-09 07:22:52,093 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 07:22:52,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:22:52,094 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:52,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 479 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:22:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 07:22:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 07:22:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-01-09 07:22:52,099 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 22 [2025-01-09 07:22:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-01-09 07:22:52,100 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-01-09 07:22:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-01-09 07:22:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 07:22:52,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:52,101 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-01-09 07:22:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:22:52,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:52,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1108928778, now seen corresponding path program 1 times [2025-01-09 07:22:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292202224] [2025-01-09 07:22:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:52,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 07:22:52,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 07:22:52,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:52,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292202224] [2025-01-09 07:22:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292202224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 07:22:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086838303] [2025-01-09 07:22:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:52,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:22:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:52,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:22:52,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:22:52,518 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:52,642 INFO L93 Difference]: Finished difference Result 238 states and 344 transitions. [2025-01-09 07:22:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:22:52,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-01-09 07:22:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:52,645 INFO L225 Difference]: With dead ends: 238 [2025-01-09 07:22:52,645 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 07:22:52,646 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-01-09 07:22:52,646 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 178 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:52,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 952 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:22:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 07:22:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-01-09 07:22:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 127 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2025-01-09 07:22:52,660 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 22 [2025-01-09 07:22:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:52,660 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2025-01-09 07:22:52,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2025-01-09 07:22:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 07:22:52,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:52,661 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-01-09 07:22:52,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:22:52,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash 302292627, now seen corresponding path program 1 times [2025-01-09 07:22:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729031788] [2025-01-09 07:22:52,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:52,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 07:22:52,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 07:22:52,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:52,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:52,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729031788] [2025-01-09 07:22:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729031788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:52,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:22:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378701281] [2025-01-09 07:22:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:52,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:22:52,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:52,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:22:52,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:22:52,970 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-01-09 07:22:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:53,017 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2025-01-09 07:22:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:22:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-01-09 07:22:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:53,019 INFO L225 Difference]: With dead ends: 252 [2025-01-09 07:22:53,019 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 07:22:53,020 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-01-09 07:22:53,022 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 161 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:53,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 485 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:22:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 07:22:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-01-09 07:22:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2025-01-09 07:22:53,036 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 23 [2025-01-09 07:22:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:53,036 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2025-01-09 07:22:53,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-01-09 07:22:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2025-01-09 07:22:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 07:22:53,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:53,037 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-01-09 07:22:53,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:22:53,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 828087592, now seen corresponding path program 1 times [2025-01-09 07:22:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:53,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427431421] [2025-01-09 07:22:53,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 07:22:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 07:22:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:53,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:53,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427431421] [2025-01-09 07:22:53,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427431421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:53,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:53,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:22:53,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338866728] [2025-01-09 07:22:53,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:53,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:22:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:53,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:22:53,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:22:53,192 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-01-09 07:22:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:53,337 INFO L93 Difference]: Finished difference Result 322 states and 454 transitions. [2025-01-09 07:22:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:22:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-01-09 07:22:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:53,339 INFO L225 Difference]: With dead ends: 322 [2025-01-09 07:22:53,340 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 07:22:53,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:22:53,341 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 318 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:53,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 595 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:22:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 07:22:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 136. [2025-01-09 07:22:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2025-01-09 07:22:53,350 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 23 [2025-01-09 07:22:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:53,350 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2025-01-09 07:22:53,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-01-09 07:22:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2025-01-09 07:22:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 07:22:53,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:53,351 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-01-09 07:22:53,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:22:53,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:53,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -29066406, now seen corresponding path program 1 times [2025-01-09 07:22:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183431349] [2025-01-09 07:22:53,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:53,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 07:22:53,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 07:22:53,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:53,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183431349] [2025-01-09 07:22:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183431349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:53,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:22:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197714025] [2025-01-09 07:22:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:53,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:22:53,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:53,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:22:53,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:22:53,482 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-01-09 07:22:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:53,579 INFO L93 Difference]: Finished difference Result 348 states and 495 transitions. [2025-01-09 07:22:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:22:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-01-09 07:22:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:53,582 INFO L225 Difference]: With dead ends: 348 [2025-01-09 07:22:53,582 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 07:22:53,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:22:53,583 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 416 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:53,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 459 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:22:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 07:22:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2025-01-09 07:22:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2025-01-09 07:22:53,599 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 24 [2025-01-09 07:22:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:53,599 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2025-01-09 07:22:53,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-01-09 07:22:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2025-01-09 07:22:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 07:22:53,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:53,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:22:53,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:22:53,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:53,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1543636838, now seen corresponding path program 1 times [2025-01-09 07:22:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046942181] [2025-01-09 07:22:53,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:53,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 07:22:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 07:22:54,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:54,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:56,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:56,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046942181] [2025-01-09 07:22:56,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046942181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:22:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103629713] [2025-01-09 07:22:56,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:56,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:22:56,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:22:56,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:22:56,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:22:56,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 07:22:56,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 07:22:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:56,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 07:22:56,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:22:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:57,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:22:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103629713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:57,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:22:57,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-01-09 07:22:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232875516] [2025-01-09 07:22:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:22:57,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:57,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:22:57,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-09 07:22:57,709 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:58,257 INFO L93 Difference]: Finished difference Result 381 states and 543 transitions. [2025-01-09 07:22:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:22:58,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 07:22:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:58,260 INFO L225 Difference]: With dead ends: 381 [2025-01-09 07:22:58,260 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 07:22:58,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-01-09 07:22:58,264 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 438 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:58,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 517 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:22:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 07:22:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 222. [2025-01-09 07:22:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.420814479638009) internal successors, (314), 221 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2025-01-09 07:22:58,275 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 77 [2025-01-09 07:22:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:58,275 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2025-01-09 07:22:58,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2025-01-09 07:22:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 07:22:58,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:58,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:22:58,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:22:58,482 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-01-09 07:22:58,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 294751161, now seen corresponding path program 1 times [2025-01-09 07:22:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245472287] [2025-01-09 07:22:58,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:58,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 07:22:58,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 07:22:58,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:22:58,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:22:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:22:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:22:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245472287] [2025-01-09 07:22:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245472287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:22:59,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:22:59,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 07:22:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768791765] [2025-01-09 07:22:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:22:59,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:22:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:22:59,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:22:59,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:22:59,595 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:22:59,934 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2025-01-09 07:22:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:22:59,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 07:22:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:22:59,937 INFO L225 Difference]: With dead ends: 375 [2025-01-09 07:22:59,937 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 07:22:59,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 07:22:59,940 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 389 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:22:59,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 596 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:22:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 07:22:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2025-01-09 07:22:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.4230769230769231) internal successors, (333), 234 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2025-01-09 07:22:59,950 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 333 transitions. Word has length 78 [2025-01-09 07:22:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:22:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 333 transitions. [2025-01-09 07:22:59,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:22:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 333 transitions. [2025-01-09 07:22:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 07:22:59,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:22:59,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:22:59,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:22:59,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:22:59,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:22:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1819497476, now seen corresponding path program 1 times [2025-01-09 07:22:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:22:59,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249883617] [2025-01-09 07:22:59,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:22:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:22:59,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 07:23:00,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 07:23:00,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:00,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249883617] [2025-01-09 07:23:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249883617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:23:00,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:23:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:23:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578730178] [2025-01-09 07:23:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:23:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:23:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:00,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:23:00,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:23:00,568 INFO L87 Difference]: Start difference. First operand 235 states and 333 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:00,686 INFO L93 Difference]: Finished difference Result 406 states and 578 transitions. [2025-01-09 07:23:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:23:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 07:23:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:00,688 INFO L225 Difference]: With dead ends: 406 [2025-01-09 07:23:00,688 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 07:23:00,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:23:00,689 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 128 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:00,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 679 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:23:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 07:23:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-01-09 07:23:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4139344262295082) internal successors, (345), 244 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 345 transitions. [2025-01-09 07:23:00,697 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 345 transitions. Word has length 78 [2025-01-09 07:23:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:00,697 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 345 transitions. [2025-01-09 07:23:00,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 345 transitions. [2025-01-09 07:23:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 07:23:00,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:00,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:00,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:23:00,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:00,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash -486456451, now seen corresponding path program 1 times [2025-01-09 07:23:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:00,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973188917] [2025-01-09 07:23:00,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:00,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:00,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 07:23:00,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 07:23:00,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:00,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973188917] [2025-01-09 07:23:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973188917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:23:01,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:23:01,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:23:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810835744] [2025-01-09 07:23:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:23:01,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:23:01,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:01,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:23:01,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:23:01,706 INFO L87 Difference]: Start difference. First operand 245 states and 345 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:01,883 INFO L93 Difference]: Finished difference Result 401 states and 566 transitions. [2025-01-09 07:23:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:23:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 07:23:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:01,885 INFO L225 Difference]: With dead ends: 401 [2025-01-09 07:23:01,885 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 07:23:01,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:23:01,886 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 376 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:01,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 747 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:23:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 07:23:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 244. [2025-01-09 07:23:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4032921810699588) internal successors, (341), 243 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 341 transitions. [2025-01-09 07:23:01,899 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 341 transitions. Word has length 79 [2025-01-09 07:23:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:01,899 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 341 transitions. [2025-01-09 07:23:01,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 341 transitions. [2025-01-09 07:23:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 07:23:01,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:01,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:23:01,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:01,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:01,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1495535523, now seen corresponding path program 1 times [2025-01-09 07:23:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:01,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222214775] [2025-01-09 07:23:01,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:01,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 07:23:02,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 07:23:02,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:02,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222214775] [2025-01-09 07:23:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222214775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:23:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634952149] [2025-01-09 07:23:03,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:23:03,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:23:03,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:23:03,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 07:23:04,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 07:23:04,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:04,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:04,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-01-09 07:23:04,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:23:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:04,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:23:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634952149] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:23:06,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 07:23:06,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 31 [2025-01-09 07:23:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595351321] [2025-01-09 07:23:06,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 07:23:06,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 07:23:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:06,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 07:23:06,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2025-01-09 07:23:06,059 INFO L87 Difference]: Start difference. First operand 244 states and 341 transitions. Second operand has 31 states, 31 states have (on average 6.774193548387097) internal successors, (210), 31 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:07,124 INFO L93 Difference]: Finished difference Result 597 states and 840 transitions. [2025-01-09 07:23:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 07:23:07,125 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.774193548387097) internal successors, (210), 31 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 07:23:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:07,128 INFO L225 Difference]: With dead ends: 597 [2025-01-09 07:23:07,128 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 07:23:07,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1813, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 07:23:07,131 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1573 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:07,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 1397 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 07:23:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 07:23:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 425. [2025-01-09 07:23:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4103773584905661) internal successors, (598), 424 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2025-01-09 07:23:07,145 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 79 [2025-01-09 07:23:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:07,148 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2025-01-09 07:23:07,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.774193548387097) internal successors, (210), 31 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2025-01-09 07:23:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 07:23:07,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:07,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:07,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 07:23:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:07,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -260135665, now seen corresponding path program 1 times [2025-01-09 07:23:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200831776] [2025-01-09 07:23:07,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:07,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 07:23:07,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 07:23:07,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:07,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200831776] [2025-01-09 07:23:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200831776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:23:07,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:23:07,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:23:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857245176] [2025-01-09 07:23:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:23:07,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:23:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:07,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:23:07,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:23:07,896 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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-01-09 07:23:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:08,006 INFO L93 Difference]: Finished difference Result 823 states and 1164 transitions. [2025-01-09 07:23:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:23:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 07:23:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:08,009 INFO L225 Difference]: With dead ends: 823 [2025-01-09 07:23:08,009 INFO L226 Difference]: Without dead ends: 440 [2025-01-09 07:23:08,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:23:08,010 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 145 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:08,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 676 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:23:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-01-09 07:23:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-01-09 07:23:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4031890660592254) internal successors, (616), 439 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 616 transitions. [2025-01-09 07:23:08,021 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 616 transitions. Word has length 80 [2025-01-09 07:23:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:08,021 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 616 transitions. [2025-01-09 07:23:08,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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-01-09 07:23:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 616 transitions. [2025-01-09 07:23:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 07:23:08,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:08,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:08,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 07:23:08,023 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:08,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 953061061, now seen corresponding path program 1 times [2025-01-09 07:23:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119623548] [2025-01-09 07:23:08,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:08,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 07:23:08,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 07:23:08,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:08,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119623548] [2025-01-09 07:23:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119623548] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:23:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024025251] [2025-01-09 07:23:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:08,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:23:08,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:23:08,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 07:23:09,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 07:23:09,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 07:23:09,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:09,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 07:23:09,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:23:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 07:23:09,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:23:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 07:23:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024025251] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:23:10,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 07:23:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-01-09 07:23:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498521816] [2025-01-09 07:23:10,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 07:23:10,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 07:23:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:10,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 07:23:10,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-01-09 07:23:10,395 INFO L87 Difference]: Start difference. First operand 440 states and 616 transitions. Second operand has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:11,554 INFO L93 Difference]: Finished difference Result 841 states and 1183 transitions. [2025-01-09 07:23:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 07:23:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 07:23:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:11,558 INFO L225 Difference]: With dead ends: 841 [2025-01-09 07:23:11,558 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 07:23:11,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-01-09 07:23:11,561 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 462 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:11,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1655 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 07:23:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 07:23:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 440. [2025-01-09 07:23:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4031890660592254) internal successors, (616), 439 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 616 transitions. [2025-01-09 07:23:11,575 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 616 transitions. Word has length 80 [2025-01-09 07:23:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:11,575 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 616 transitions. [2025-01-09 07:23:11,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 616 transitions. [2025-01-09 07:23:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 07:23:11,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:11,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:11,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 07:23:11,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:11,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:11,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1448209989, now seen corresponding path program 1 times [2025-01-09 07:23:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:11,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464387486] [2025-01-09 07:23:11,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:11,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 07:23:12,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 07:23:12,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:12,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:23:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464387486] [2025-01-09 07:23:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464387486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:23:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526778583] [2025-01-09 07:23:12,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:12,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:23:12,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:23:12,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 07:23:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 07:23:13,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 07:23:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:13,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 07:23:13,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:23:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:23:14,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:23:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 07:23:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526778583] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:23:15,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 07:23:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2025-01-09 07:23:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885463096] [2025-01-09 07:23:15,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 07:23:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 07:23:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:15,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 07:23:15,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2025-01-09 07:23:15,532 INFO L87 Difference]: Start difference. First operand 440 states and 616 transitions. Second operand has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:16,265 INFO L93 Difference]: Finished difference Result 811 states and 1140 transitions. [2025-01-09 07:23:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 07:23:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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 81 [2025-01-09 07:23:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:16,268 INFO L225 Difference]: With dead ends: 811 [2025-01-09 07:23:16,268 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 07:23:16,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 07:23:16,269 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 443 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:16,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1721 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:23:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 07:23:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 444. [2025-01-09 07:23:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.399548532731377) internal successors, (620), 443 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 620 transitions. [2025-01-09 07:23:16,281 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 620 transitions. Word has length 81 [2025-01-09 07:23:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:16,282 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 620 transitions. [2025-01-09 07:23:16,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 620 transitions. [2025-01-09 07:23:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 07:23:16,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:16,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:16,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 07:23:16,486 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,SelfDestructingSolverStorable15 [2025-01-09 07:23:16,487 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:16,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 107287140, now seen corresponding path program 1 times [2025-01-09 07:23:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003254808] [2025-01-09 07:23:16,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:16,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 07:23:16,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 07:23:16,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:16,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:16,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:16,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003254808] [2025-01-09 07:23:16,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003254808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:23:16,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:23:16,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:23:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908102414] [2025-01-09 07:23:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:23:16,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:23:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:16,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:23:16,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:23:16,724 INFO L87 Difference]: Start difference. First operand 444 states and 620 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:16,759 INFO L93 Difference]: Finished difference Result 899 states and 1260 transitions. [2025-01-09 07:23:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:23:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2025-01-09 07:23:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:16,761 INFO L225 Difference]: With dead ends: 899 [2025-01-09 07:23:16,762 INFO L226 Difference]: Without dead ends: 500 [2025-01-09 07:23:16,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:23:16,763 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 16 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:16,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 640 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:23:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-01-09 07:23:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 480. [2025-01-09 07:23:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.394572025052192) internal successors, (668), 479 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 668 transitions. [2025-01-09 07:23:16,774 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 668 transitions. Word has length 81 [2025-01-09 07:23:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:16,775 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 668 transitions. [2025-01-09 07:23:16,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 668 transitions. [2025-01-09 07:23:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 07:23:16,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:16,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:16,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 07:23:16,776 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:16,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash 790874219, now seen corresponding path program 1 times [2025-01-09 07:23:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:16,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313411463] [2025-01-09 07:23:16,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:16,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 07:23:16,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 07:23:16,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:16,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:23:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313411463] [2025-01-09 07:23:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313411463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:23:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:23:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:23:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461503708] [2025-01-09 07:23:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:23:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:23:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:23:17,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:23:17,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:23:17,247 INFO L87 Difference]: Start difference. First operand 480 states and 668 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:17,298 INFO L93 Difference]: Finished difference Result 930 states and 1301 transitions. [2025-01-09 07:23:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:23:17,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2025-01-09 07:23:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:17,301 INFO L225 Difference]: With dead ends: 930 [2025-01-09 07:23:17,301 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 07:23:17,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:23:17,303 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 146 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:23:17,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 602 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:23:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 07:23:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2025-01-09 07:23:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.392354124748491) internal successors, (692), 497 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 692 transitions. [2025-01-09 07:23:17,314 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 692 transitions. Word has length 81 [2025-01-09 07:23:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:17,314 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 692 transitions. [2025-01-09 07:23:17,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:23:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 692 transitions. [2025-01-09 07:23:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 07:23:17,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:17,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:17,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 07:23:17,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash -785585405, now seen corresponding path program 1 times [2025-01-09 07:23:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:23:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950801010] [2025-01-09 07:23:17,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:23:17,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 07:23:17,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 07:23:17,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:23:17,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:23:17,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 07:23:17,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 07:23:17,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:17,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:23:17,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:23:17,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:23:17,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:23:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 07:23:17,973 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:18,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:23:18,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:23:18 BoogieIcfgContainer [2025-01-09 07:23:18,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:23:18,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:23:18,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:23:18,063 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:23:18,064 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:22:50" (3/4) ... [2025-01-09 07:23:18,066 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:23:18,066 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:23:18,067 INFO L158 Benchmark]: Toolchain (without parser) took 29470.49ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 110.2MB in the beginning and 588.0MB in the end (delta: -477.8MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2025-01-09 07:23:18,067 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:23:18,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.20ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 91.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 07:23:18,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.53ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 80.1MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 07:23:18,068 INFO L158 Benchmark]: Boogie Preprocessor took 164.33ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 72.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:23:18,068 INFO L158 Benchmark]: RCFGBuilder took 979.68ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 74.4MB in the end (delta: -1.8MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2025-01-09 07:23:18,069 INFO L158 Benchmark]: TraceAbstraction took 27825.49ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 73.8MB in the beginning and 588.2MB in the end (delta: -514.4MB). Peak memory consumption was 410.7MB. Max. memory is 16.1GB. [2025-01-09 07:23:18,069 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 729.8MB. Free memory was 588.2MB in the beginning and 588.0MB in the end (delta: 150.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:23:18,072 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.66ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.20ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 91.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.53ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 80.1MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.33ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 72.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 979.68ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 74.4MB in the end (delta: -1.8MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27825.49ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 73.8MB in the beginning and 588.2MB in the end (delta: -514.4MB). Peak memory consumption was 410.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 729.8MB. Free memory was 588.2MB in the beginning and 588.0MB in the end (delta: 150.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 88, overapproximation of bitwiseAnd at line 81, overapproximation of bitwiseAnd at line 284, overapproximation of bitwiseAnd at line 93. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 32); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (32 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (3 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 2); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (2 - 1); [L38] const SORT_1 var_4 = 0; [L39] const SORT_7 var_9 = 1; [L40] const SORT_12 var_13 = 0; [L41] const SORT_1 var_21 = 1; [L42] const SORT_12 var_28 = 2; [L43] const SORT_12 var_31 = 1; [L44] const SORT_12 var_35 = 4; [L45] const SORT_12 var_38 = 6; [L46] const SORT_12 var_41 = 5; [L47] const SORT_12 var_45 = 3; [L48] const SORT_7 var_57 = 0; [L50] SORT_1 input_2; [L51] SORT_1 input_3; [L52] SORT_12 input_55; [L53] SORT_12 input_62; [L54] SORT_12 input_75; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L56] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L57] SORT_12 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_12; [L59] SORT_1 init_6_arg_1 = var_4; [L60] state_5 = init_6_arg_1 [L61] SORT_12 init_15_arg_1 = var_13; [L62] state_14 = init_15_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_16_arg_0=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-256, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND FALSE !(!(cond)) [L96] RET __VERIFIER_assert(!(bad_24_arg_0)) [L98] SORT_12 var_42_arg_0 = state_14; [L99] SORT_12 var_42_arg_1 = var_41; [L100] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L101] SORT_12 var_39_arg_0 = state_14; [L102] SORT_12 var_39_arg_1 = var_38; [L103] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L104] SORT_1 var_43_arg_0 = var_42; [L105] SORT_1 var_43_arg_1 = var_39; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_43_arg_0=0, var_43_arg_1=0, var_45=3, var_4=0, var_57=0, var_9=1] [L106] EXPR var_43_arg_0 | var_43_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L106] SORT_1 var_43 = var_43_arg_0 | var_43_arg_1; [L107] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_39=0, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L107] var_43 = var_43 & mask_SORT_1 [L108] SORT_12 var_36_arg_0 = state_14; [L109] SORT_12 var_36_arg_1 = var_35; [L110] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L111] SORT_12 var_46_arg_0 = state_14; [L112] SORT_12 var_46_arg_1 = var_45; [L113] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L114] SORT_1 var_48_arg_0 = var_36; [L115] SORT_1 var_48_arg_1 = var_46; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_48_arg_0=0, var_48_arg_1=0, var_4=0, var_57=0, var_9=1] [L116] EXPR ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L116] SORT_47 var_48 = ((SORT_47)var_48_arg_0 << 1) | var_48_arg_1; [L117] EXPR var_48 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L117] var_48 = var_48 & mask_SORT_47 [L118] SORT_1 var_49_arg_0 = var_43; [L119] SORT_47 var_49_arg_1 = var_48; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_49_arg_0=0, var_49_arg_1=0, var_4=0, var_57=0, var_9=1] [L120] EXPR ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L120] SORT_12 var_49 = ((SORT_12)var_49_arg_0 << 2) | var_49_arg_1; [L121] EXPR var_49 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_36=0, var_38=6, var_39=0, var_41=5, var_43=0, var_45=3, var_4=0, var_57=0, var_9=1] [L121] var_49 = var_49 & mask_SORT_12 [L122] SORT_12 var_50_arg_0 = var_49; [L123] SORT_1 var_50 = var_50_arg_0 != 0; [L124] SORT_1 var_40_arg_0 = var_39; [L125] SORT_1 var_40_arg_1 = var_4; [L126] SORT_1 var_40_arg_2 = var_4; [L127] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L128] SORT_1 var_37_arg_0 = var_36; [L129] SORT_1 var_37_arg_1 = var_21; [L130] SORT_1 var_37_arg_2 = var_4; [L131] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L132] SORT_1 var_44_arg_0 = var_43; [L133] SORT_1 var_44_arg_1 = var_40; [L134] SORT_1 var_44_arg_2 = var_37; [L135] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L136] SORT_12 var_32_arg_0 = state_14; [L137] SORT_12 var_32_arg_1 = var_31; [L138] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L139] SORT_12 var_29_arg_0 = state_14; [L140] SORT_12 var_29_arg_1 = var_28; [L141] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L142] SORT_1 var_33_arg_0 = var_32; [L143] SORT_1 var_33_arg_1 = var_29; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_33_arg_0=0, var_33_arg_1=0, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] EXPR var_33_arg_0 | var_33_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L144] SORT_1 var_33 = var_33_arg_0 | var_33_arg_1; [L145] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=0, state_5=0, var_13=0, var_21=1, var_28=2, var_29=0, var_31=1, var_35=4, var_38=6, var_41=5, var_44=0, var_45=3, var_4=0, var_50=0, var_57=0, var_9=1] [L145] var_33 = var_33 & mask_SORT_1 [L146] SORT_1 var_30_arg_0 = var_29; [L147] SORT_1 var_30_arg_1 = var_4; [L148] SORT_1 var_30_arg_2 = var_4; [L149] SORT_1 var_30 = var_30_arg_0 ? var_30_arg_1 : var_30_arg_2; [L150] SORT_12 var_26_arg_0 = state_14; [L151] SORT_12 var_26_arg_1 = var_13; [L152] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L153] SORT_1 var_27_arg_0 = var_26; [L154] SORT_1 var_27_arg_1 = var_4; [L155] SORT_1 var_27_arg_2 = state_5; [L156] SORT_1 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L157] SORT_1 var_34_arg_0 = var_33; [L158] SORT_1 var_34_arg_1 = var_30; [L159] SORT_1 var_34_arg_2 = var_27; [L160] SORT_1 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L161] SORT_1 var_51_arg_0 = var_50; [L162] SORT_1 var_51_arg_1 = var_44; [L163] SORT_1 var_51_arg_2 = var_34; [L164] SORT_1 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L165] SORT_1 next_52_arg_1 = var_51; [L166] SORT_12 var_83_arg_0 = state_14; [L167] SORT_12 var_83_arg_1 = var_41; [L168] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L169] SORT_12 var_81_arg_0 = state_14; [L170] SORT_12 var_81_arg_1 = var_38; [L171] SORT_1 var_81 = var_81_arg_0 == var_81_arg_1; [L172] SORT_1 var_84_arg_0 = var_83; [L173] SORT_1 var_84_arg_1 = var_81; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_84_arg_0=0, var_84_arg_1=0, var_9=1] [L174] EXPR var_84_arg_0 | var_84_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L174] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L175] EXPR var_84 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_81=0, var_9=1] [L175] var_84 = var_84 & mask_SORT_1 [L176] SORT_12 var_73_arg_0 = state_14; [L177] SORT_12 var_73_arg_1 = var_35; [L178] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L179] SORT_12 var_86_arg_0 = state_14; [L180] SORT_12 var_86_arg_1 = var_45; [L181] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L182] SORT_1 var_87_arg_0 = var_73; [L183] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_87_arg_0=0, var_87_arg_1=0, var_9=1] [L184] EXPR ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L184] SORT_47 var_87 = ((SORT_47)var_87_arg_0 << 1) | var_87_arg_1; [L185] EXPR var_87 & mask_SORT_47 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L185] var_87 = var_87 & mask_SORT_47 [L186] SORT_1 var_88_arg_0 = var_84; [L187] SORT_47 var_88_arg_1 = var_87; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_88_arg_0=0, var_88_arg_1=0, var_9=1] [L188] EXPR ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L188] SORT_12 var_88 = ((SORT_12)var_88_arg_0 << 2) | var_88_arg_1; [L189] EXPR var_88 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_81=0, var_84=0, var_9=1] [L189] var_88 = var_88 & mask_SORT_12 [L190] SORT_12 var_89_arg_0 = var_88; [L191] SORT_1 var_89 = var_89_arg_0 != 0; [L192] SORT_12 var_79_arg_0 = state_14; [L193] SORT_12 var_79_arg_1 = var_38; [L194] SORT_1 var_79 = var_79_arg_0 == var_79_arg_1; [L195] SORT_1 var_76_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_76_arg_0=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] EXPR var_76_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_73=0, var_79=0, var_81=0, var_84=0, var_89=0, var_9=1] [L196] var_76_arg_0 = var_76_arg_0 & mask_SORT_1 [L197] SORT_7 var_76 = var_76_arg_0; [L198] SORT_7 var_77_arg_0 = var_76; [L199] SORT_7 var_77_arg_1 = var_57; [L200] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L201] SORT_1 var_78_arg_0 = var_77; [L202] SORT_12 var_78_arg_1 = var_35; [L203] SORT_12 var_78_arg_2 = var_13; [L204] SORT_12 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_80_arg_0 = var_79; [L206] SORT_12 var_80_arg_1 = var_78; [L207] SORT_12 var_80_arg_2 = input_75; [L208] SORT_12 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L209] SORT_1 var_82_arg_0 = var_81; [L210] SORT_12 var_82_arg_1 = var_80; [L211] SORT_12 var_82_arg_2 = var_38; [L212] SORT_12 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L213] SORT_1 var_74_arg_0 = var_73; [L214] SORT_12 var_74_arg_1 = var_31; [L215] SORT_12 var_74_arg_2 = var_35; [L216] SORT_12 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L217] SORT_1 var_85_arg_0 = var_84; [L218] SORT_12 var_85_arg_1 = var_82; [L219] SORT_12 var_85_arg_2 = var_74; [L220] SORT_12 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L221] SORT_12 var_70_arg_0 = state_14; [L222] SORT_12 var_70_arg_1 = var_31; [L223] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L224] SORT_12 var_68_arg_0 = state_14; [L225] SORT_12 var_68_arg_1 = var_28; [L226] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L227] SORT_1 var_71_arg_0 = var_70; [L228] SORT_1 var_71_arg_1 = var_68; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_71_arg_0=0, var_71_arg_1=0, var_85=4, var_89=0, var_9=1] [L229] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L229] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L230] EXPR var_71 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_68=0, var_85=4, var_89=0, var_9=1] [L230] var_71 = var_71 & mask_SORT_1 [L231] SORT_12 var_66_arg_0 = state_14; [L232] SORT_12 var_66_arg_1 = var_28; [L233] SORT_1 var_66 = var_66_arg_0 == var_66_arg_1; [L234] SORT_1 var_63_arg_0 = input_2; VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_63_arg_0=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_2=0, mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_66=0, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L235] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L236] SORT_7 var_63 = var_63_arg_0; [L237] SORT_7 var_64_arg_0 = var_63; [L238] SORT_7 var_64_arg_1 = var_57; [L239] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L240] SORT_1 var_65_arg_0 = var_64; [L241] SORT_12 var_65_arg_1 = var_45; [L242] SORT_12 var_65_arg_2 = var_38; [L243] SORT_12 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L244] SORT_1 var_67_arg_0 = var_66; [L245] SORT_12 var_67_arg_1 = var_65; [L246] SORT_12 var_67_arg_2 = input_62; [L247] SORT_12 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L248] SORT_12 var_60_arg_0 = state_14; [L249] SORT_12 var_60_arg_1 = var_31; [L250] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L251] SORT_1 var_56_arg_0 = input_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_56_arg_0=0, var_57=0, var_60=0, var_67=3, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] EXPR var_56_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, state_14=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_60=0, var_67=3, var_68=0, var_71=0, var_85=4, var_89=0, var_9=1] [L252] var_56_arg_0 = var_56_arg_0 & mask_SORT_1 [L253] SORT_7 var_56 = var_56_arg_0; [L254] SORT_7 var_58_arg_0 = var_56; [L255] SORT_7 var_58_arg_1 = var_57; [L256] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L257] SORT_1 var_59_arg_0 = var_58; [L258] SORT_12 var_59_arg_1 = var_28; [L259] SORT_12 var_59_arg_2 = var_41; [L260] SORT_12 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L261] SORT_1 var_61_arg_0 = var_60; [L262] SORT_12 var_61_arg_1 = var_59; [L263] SORT_12 var_61_arg_2 = input_55; [L264] SORT_12 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L265] SORT_1 var_69_arg_0 = var_68; [L266] SORT_12 var_69_arg_1 = var_67; [L267] SORT_12 var_69_arg_2 = var_61; [L268] SORT_12 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L269] SORT_12 var_53_arg_0 = state_14; [L270] SORT_12 var_53_arg_1 = var_13; [L271] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L272] SORT_1 var_54_arg_0 = var_53; [L273] SORT_12 var_54_arg_1 = var_31; [L274] SORT_12 var_54_arg_2 = state_14; [L275] SORT_12 var_54 = var_54_arg_0 ? var_54_arg_1 : var_54_arg_2; [L276] SORT_1 var_72_arg_0 = var_71; [L277] SORT_12 var_72_arg_1 = var_69; [L278] SORT_12 var_72_arg_2 = var_54; [L279] SORT_12 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L280] SORT_1 var_90_arg_0 = var_89; [L281] SORT_12 var_90_arg_1 = var_85; [L282] SORT_12 var_90_arg_2 = var_72; [L283] SORT_12 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_90=1, var_9=1] [L284] EXPR var_90 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, next_52_arg_1=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L284] var_90 = var_90 & mask_SORT_12 [L285] SORT_12 next_91_arg_1 = var_90; [L287] state_5 = next_52_arg_1 [L288] state_14 = next_91_arg_1 [L65] input_2 = __VERIFIER_nondet_uchar() [L66] input_3 = __VERIFIER_nondet_uchar() [L67] input_55 = __VERIFIER_nondet_uchar() [L68] input_62 = __VERIFIER_nondet_uchar() [L69] input_75 = __VERIFIER_nondet_uchar() [L72] SORT_1 var_8_arg_0 = state_5; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_8_arg_0=0, var_9=1] [L73] EXPR var_8_arg_0 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L73] var_8_arg_0 = var_8_arg_0 & mask_SORT_1 [L74] SORT_7 var_8 = var_8_arg_0; [L75] SORT_7 var_10_arg_0 = var_8; [L76] SORT_7 var_10_arg_1 = var_9; [L77] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L78] SORT_1 var_11_arg_0 = var_10; [L79] SORT_1 var_11 = ~var_11_arg_0; [L80] SORT_12 var_16_arg_0 = state_14; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_16_arg_0=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] EXPR var_16_arg_0 & mask_SORT_12 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_11=-1, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L81] var_16_arg_0 = var_16_arg_0 & mask_SORT_12 [L82] SORT_7 var_16 = var_16_arg_0; [L83] SORT_7 var_17_arg_0 = var_16; [L84] SORT_7 var_17_arg_1 = var_9; [L85] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L86] SORT_1 var_18_arg_0 = var_11; [L87] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_18_arg_0=-1, var_18_arg_1=1, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L88] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L89] SORT_1 var_22_arg_0 = var_18; [L90] SORT_1 var_22 = ~var_22_arg_0; [L91] SORT_1 var_23_arg_0 = var_21; [L92] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L93] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L94] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_12=7, mask_SORT_1=1, mask_SORT_47=3, state_14=1, state_5=0, var_13=0, var_21=1, var_28=2, var_31=1, var_35=4, var_38=6, var_41=5, var_45=3, var_4=0, var_57=0, var_9=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 bad_24_arg_0 = var_23; [L96] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5357 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5357 mSDsluCounter, 13814 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11188 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5330 IncrementalHoareTripleChecker+Invalid, 5355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 2626 mSDtfsCounter, 5330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 746 GetRequests, 546 SyntacticMatches, 3 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=18, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 547 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1500 ConstructedInterpolants, 0 QuantifiedInterpolants, 12195 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2735 ConjunctsInSsa, 253 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 183/221 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 07:23:18,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:23:20,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:23:20,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:23:20,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:23:20,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:23:20,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:23:20,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:23:20,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:23:20,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:23:20,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:23:20,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:23:20,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:23:20,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:23:20,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:23:20,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:23:20,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:23:20,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:23:20,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:23:20,476 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e188a971cba665e2b77b0e826b47d617ddf57bd12a8f8136f6d81bf903c7591b [2025-01-09 07:23:20,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:23:20,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:23:20,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:23:20,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:23:20,790 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:23:20,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-01-09 07:23:22,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7015c2fd9/f96bcd8b2aaf455ea8b2dd643c1413bf/FLAGe0a039dc4 [2025-01-09 07:23:22,335 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:23:22,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c [2025-01-09 07:23:22,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7015c2fd9/f96bcd8b2aaf455ea8b2dd643c1413bf/FLAGe0a039dc4 [2025-01-09 07:23:22,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7015c2fd9/f96bcd8b2aaf455ea8b2dd643c1413bf [2025-01-09 07:23:22,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:23:22,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:23:22,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:23:22,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:23:22,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:23:22,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:23:22" (1/1) ... [2025-01-09 07:23:22,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca4bb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:22, skipping insertion in model container [2025-01-09 07:23:22,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:23:22" (1/1) ... [2025-01-09 07:23:22,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:23:22,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-01-09 07:23:22,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:23:22,953 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:23:22,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b02.c[1245,1258] [2025-01-09 07:23:23,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:23:23,049 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:23:23,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23 WrapperNode [2025-01-09 07:23:23,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:23:23,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:23:23,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:23:23,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:23:23,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,117 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 290 [2025-01-09 07:23:23,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:23:23,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:23:23,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:23:23,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:23:23,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,169 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-01-09 07:23:23,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:23:23,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:23:23,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:23:23,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:23:23,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (1/1) ... [2025-01-09 07:23:23,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:23:23,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:23:23,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:23:23,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:23:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:23:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:23:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 07:23:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:23:23,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:23:23,401 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:23:23,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:23:23,763 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 07:23:23,764 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:23:23,772 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:23:23,772 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:23:23,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:23:23 BoogieIcfgContainer [2025-01-09 07:23:23,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:23:23,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:23:23,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:23:23,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:23:23,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:23:22" (1/3) ... [2025-01-09 07:23:23,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2825a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:23:23, skipping insertion in model container [2025-01-09 07:23:23,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:23:23" (2/3) ... [2025-01-09 07:23:23,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2825a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:23:23, skipping insertion in model container [2025-01-09 07:23:23,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:23:23" (3/3) ... [2025-01-09 07:23:23,784 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b02.c [2025-01-09 07:23:23,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:23:23,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b02.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:23:23,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:23:23,851 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;@1935299a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:23:23,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:23:23,855 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-01-09 07:23:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 07:23:23,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:23,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 07:23:23,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:23,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 07:23:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:23:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101584718] [2025-01-09 07:23:23,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:23,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:23,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:23:23,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:23:23,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:23:24,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 07:23:24,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 07:23:24,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:24,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:24,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 07:23:24,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:23:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:24,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:23:24,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:23:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101584718] [2025-01-09 07:23:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101584718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:23:24,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:23:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:23:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5744366] [2025-01-09 07:23:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:23:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:23:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:23:24,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:23:24,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:23:24,287 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-01-09 07:23:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:23:24,333 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 07:23:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:23:24,335 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-01-09 07:23:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:23:24,341 INFO L225 Difference]: With dead ends: 18 [2025-01-09 07:23:24,341 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 07:23:24,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:23:24,348 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-01-09 07:23:24,350 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-01-09 07:23:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 07:23:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 07:23:24,372 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-01-09 07:23:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:23:24,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 07:23:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:23:24,380 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:23:24,380 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-01-09 07:23:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:23:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 07:23:24,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:23:24,381 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:23:24,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 07:23:24,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:24,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:23:24,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:23:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 07:23:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:23:24,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310060535] [2025-01-09 07:23:24,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:23:24,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:23:24,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:23:24,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:23:24,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:23:24,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 07:23:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 07:23:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:23:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:23:24,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 07:23:24,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:23:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:23:28,933 INFO L312 TraceCheckSpWp]: Computing backward predicates...