./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.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 d4a5712020ec411b26b222aa2e78595cdb24e1f443506a64eda3410a2987f6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:17,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:17,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:15:17,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:17,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:17,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:17,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:17,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:17,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:17,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:17,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:17,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:17,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:17,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:17,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:17,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:17,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:17,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:17,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:17,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:17,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:15:17,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:15:17,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:17,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:17,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:17,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:17,096 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 -> d4a5712020ec411b26b222aa2e78595cdb24e1f443506a64eda3410a2987f6a8 [2025-02-08 00:15:17,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:17,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:17,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:17,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:17,382 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:17,383 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.vis_arrays_vsaR_p07.c [2025-02-08 00:15:18,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a641f245/cd000f1b3b564f48a75adac7a2c1c5ba/FLAG2fcf0f051 [2025-02-08 00:15:18,865 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:18,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c [2025-02-08 00:15:18,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a641f245/cd000f1b3b564f48a75adac7a2c1c5ba/FLAG2fcf0f051 [2025-02-08 00:15:18,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a641f245/cd000f1b3b564f48a75adac7a2c1c5ba [2025-02-08 00:15:18,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:18,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:18,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:18,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:18,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:18,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:18" (1/1) ... [2025-02-08 00:15:18,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f59e083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:18, skipping insertion in model container [2025-02-08 00:15:18,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:18" (1/1) ... [2025-02-08 00:15:18,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:19,080 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.vis_arrays_vsaR_p07.c[1259,1272] [2025-02-08 00:15:19,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:19,285 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:19,300 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.vis_arrays_vsaR_p07.c[1259,1272] [2025-02-08 00:15:19,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:19,421 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:19,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19 WrapperNode [2025-02-08 00:15:19,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:19,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:19,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:19,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:19,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,639 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2162 [2025-02-08 00:15:19,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:19,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:19,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:19,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:19,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,737 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:19,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:19,922 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:19,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:19,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:19,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (1/1) ... [2025-02-08 00:15:19,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:19,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:19,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:20,207 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:20,209 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:21,863 INFO L? ?]: Removed 1353 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:21,863 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:21,928 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:21,929 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:21,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:21 BoogieIcfgContainer [2025-02-08 00:15:21,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:21,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:21,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:21,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:21,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:18" (1/3) ... [2025-02-08 00:15:21,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a5e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:21, skipping insertion in model container [2025-02-08 00:15:21,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:19" (2/3) ... [2025-02-08 00:15:21,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a5e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:21, skipping insertion in model container [2025-02-08 00:15:21,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:21" (3/3) ... [2025-02-08 00:15:21,935 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p07.c [2025-02-08 00:15:21,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:21,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p07.c that has 1 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:21,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:21,992 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;@5dc7bf86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:21,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:15:22,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:22,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:22,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1137222073, now seen corresponding path program 1 times [2025-02-08 00:15:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728620837] [2025-02-08 00:15:22,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:22,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:15:22,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:15:22,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:22,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728620837] [2025-02-08 00:15:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728620837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:22,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:22,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631538120] [2025-02-08 00:15:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:22,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:22,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:22,622 INFO L87 Difference]: Start difference. First operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 0 states have call successors, (0), 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 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:22,944 INFO L93 Difference]: Finished difference Result 1037 states and 1553 transitions. [2025-02-08 00:15:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-08 00:15:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:22,952 INFO L225 Difference]: With dead ends: 1037 [2025-02-08 00:15:22,953 INFO L226 Difference]: Without dead ends: 545 [2025-02-08 00:15:22,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:22,956 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:22,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2023 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-08 00:15:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-08 00:15:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 544 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 814 transitions. [2025-02-08 00:15:22,993 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 814 transitions. Word has length 50 [2025-02-08 00:15:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:22,994 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 814 transitions. [2025-02-08 00:15:22,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 814 transitions. [2025-02-08 00:15:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 00:15:22,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:22,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:22,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:22,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:22,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -889465973, now seen corresponding path program 1 times [2025-02-08 00:15:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814862872] [2025-02-08 00:15:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:23,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:15:23,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:15:23,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814862872] [2025-02-08 00:15:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814862872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:23,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792267400] [2025-02-08 00:15:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:23,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:23,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:23,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:23,200 INFO L87 Difference]: Start difference. First operand 545 states and 814 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:23,421 INFO L93 Difference]: Finished difference Result 1039 states and 1552 transitions. [2025-02-08 00:15:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-08 00:15:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:23,424 INFO L225 Difference]: With dead ends: 1039 [2025-02-08 00:15:23,424 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 00:15:23,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:23,425 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:23,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 00:15:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-08 00:15:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2025-02-08 00:15:23,444 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 51 [2025-02-08 00:15:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:23,444 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2025-02-08 00:15:23,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2025-02-08 00:15:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 00:15:23,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:23,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:23,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:23,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:23,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 127868610, now seen corresponding path program 1 times [2025-02-08 00:15:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373848248] [2025-02-08 00:15:23,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:23,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 00:15:23,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 00:15:23,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:23,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:23,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:23,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373848248] [2025-02-08 00:15:23,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373848248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:23,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:23,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:23,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022367115] [2025-02-08 00:15:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:23,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:23,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:23,827 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:24,267 INFO L93 Difference]: Finished difference Result 1051 states and 1568 transitions. [2025-02-08 00:15:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-08 00:15:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:24,269 INFO L225 Difference]: With dead ends: 1051 [2025-02-08 00:15:24,269 INFO L226 Difference]: Without dead ends: 557 [2025-02-08 00:15:24,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:24,271 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 6 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4013 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:24,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4013 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-08 00:15:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2025-02-08 00:15:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4936936936936938) internal successors, (829), 555 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 829 transitions. [2025-02-08 00:15:24,279 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 829 transitions. Word has length 52 [2025-02-08 00:15:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:24,280 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 829 transitions. [2025-02-08 00:15:24,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 829 transitions. [2025-02-08 00:15:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 00:15:24,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:24,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:24,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:24,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:24,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash 557224218, now seen corresponding path program 1 times [2025-02-08 00:15:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182608124] [2025-02-08 00:15:24,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:24,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 00:15:24,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 00:15:24,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:24,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:24,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182608124] [2025-02-08 00:15:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182608124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777402475] [2025-02-08 00:15:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:24,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:24,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:24,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:24,490 INFO L87 Difference]: Start difference. First operand 556 states and 829 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:24,771 INFO L93 Difference]: Finished difference Result 1069 states and 1594 transitions. [2025-02-08 00:15:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:24,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-08 00:15:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:24,773 INFO L225 Difference]: With dead ends: 1069 [2025-02-08 00:15:24,773 INFO L226 Difference]: Without dead ends: 566 [2025-02-08 00:15:24,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:24,775 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:24,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2690 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-08 00:15:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-02-08 00:15:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.4920353982300885) internal successors, (843), 565 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 843 transitions. [2025-02-08 00:15:24,790 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 843 transitions. Word has length 53 [2025-02-08 00:15:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:24,791 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 843 transitions. [2025-02-08 00:15:24,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 843 transitions. [2025-02-08 00:15:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 00:15:24,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:24,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:24,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:24,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1739856579, now seen corresponding path program 1 times [2025-02-08 00:15:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106208119] [2025-02-08 00:15:24,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:24,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 00:15:24,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 00:15:24,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:24,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106208119] [2025-02-08 00:15:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106208119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:15:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315962435] [2025-02-08 00:15:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:15:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:25,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:15:25,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:15:25,091 INFO L87 Difference]: Start difference. First operand 566 states and 843 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:25,273 INFO L93 Difference]: Finished difference Result 1079 states and 1607 transitions. [2025-02-08 00:15:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:15:25,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-08 00:15:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:25,275 INFO L225 Difference]: With dead ends: 1079 [2025-02-08 00:15:25,276 INFO L226 Difference]: Without dead ends: 566 [2025-02-08 00:15:25,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:15:25,277 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 2 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:25,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1345 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:15:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-08 00:15:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-02-08 00:15:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.488495575221239) internal successors, (841), 565 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2025-02-08 00:15:25,285 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 54 [2025-02-08 00:15:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:25,285 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2025-02-08 00:15:25,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2025-02-08 00:15:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 00:15:25,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:25,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:25,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1429887818, now seen corresponding path program 1 times [2025-02-08 00:15:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813515872] [2025-02-08 00:15:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:25,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 00:15:25,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 00:15:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:25,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813515872] [2025-02-08 00:15:25,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813515872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:25,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:25,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 00:15:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623887339] [2025-02-08 00:15:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:25,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:15:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:25,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:15:25,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:15:25,847 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:26,523 INFO L93 Difference]: Finished difference Result 1086 states and 1612 transitions. [2025-02-08 00:15:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:15:26,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-08 00:15:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:26,525 INFO L225 Difference]: With dead ends: 1086 [2025-02-08 00:15:26,525 INFO L226 Difference]: Without dead ends: 573 [2025-02-08 00:15:26,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:15:26,526 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 781 mSDsluCounter, 4644 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:26,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 5310 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:15:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-08 00:15:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 570. [2025-02-08 00:15:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4868189806678382) internal successors, (846), 569 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 846 transitions. [2025-02-08 00:15:26,540 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 846 transitions. Word has length 55 [2025-02-08 00:15:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 846 transitions. [2025-02-08 00:15:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 846 transitions. [2025-02-08 00:15:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 00:15:26,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:26,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:15:26,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1726032348, now seen corresponding path program 1 times [2025-02-08 00:15:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636163165] [2025-02-08 00:15:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:26,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 00:15:26,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 00:15:26,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:26,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:26,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636163165] [2025-02-08 00:15:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636163165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298913182] [2025-02-08 00:15:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:26,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:26,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:26,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:26,803 INFO L87 Difference]: Start difference. First operand 570 states and 846 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:27,226 INFO L93 Difference]: Finished difference Result 1283 states and 1899 transitions. [2025-02-08 00:15:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:27,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-08 00:15:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:27,229 INFO L225 Difference]: With dead ends: 1283 [2025-02-08 00:15:27,229 INFO L226 Difference]: Without dead ends: 766 [2025-02-08 00:15:27,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:27,230 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 1337 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:27,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 2643 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-08 00:15:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 576. [2025-02-08 00:15:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.4852173913043478) internal successors, (854), 575 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 854 transitions. [2025-02-08 00:15:27,239 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 854 transitions. Word has length 55 [2025-02-08 00:15:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:27,239 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 854 transitions. [2025-02-08 00:15:27,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 854 transitions. [2025-02-08 00:15:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 00:15:27,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:27,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:27,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:15:27,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:27,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:27,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1730828170, now seen corresponding path program 1 times [2025-02-08 00:15:27,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:27,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24992595] [2025-02-08 00:15:27,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:27,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:27,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 00:15:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 00:15:27,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:27,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24992595] [2025-02-08 00:15:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24992595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:27,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735205299] [2025-02-08 00:15:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:27,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:27,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:27,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:27,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:27,497 INFO L87 Difference]: Start difference. First operand 576 states and 854 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:27,811 INFO L93 Difference]: Finished difference Result 1330 states and 1966 transitions. [2025-02-08 00:15:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:27,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-08 00:15:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:27,814 INFO L225 Difference]: With dead ends: 1330 [2025-02-08 00:15:27,814 INFO L226 Difference]: Without dead ends: 807 [2025-02-08 00:15:27,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:27,815 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1066 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:27,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1989 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-08 00:15:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 622. [2025-02-08 00:15:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.4782608695652173) internal successors, (918), 621 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 918 transitions. [2025-02-08 00:15:27,825 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 918 transitions. Word has length 56 [2025-02-08 00:15:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 918 transitions. [2025-02-08 00:15:27,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 918 transitions. [2025-02-08 00:15:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 00:15:27,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:27,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:15:27,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 440202289, now seen corresponding path program 1 times [2025-02-08 00:15:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888665062] [2025-02-08 00:15:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:27,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 00:15:27,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 00:15:27,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:27,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888665062] [2025-02-08 00:15:28,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888665062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:28,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:28,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:15:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874149025] [2025-02-08 00:15:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:15:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:28,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:15:28,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:28,401 INFO L87 Difference]: Start difference. First operand 622 states and 918 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:29,019 INFO L93 Difference]: Finished difference Result 1326 states and 1959 transitions. [2025-02-08 00:15:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:15:29,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-08 00:15:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:29,023 INFO L225 Difference]: With dead ends: 1326 [2025-02-08 00:15:29,023 INFO L226 Difference]: Without dead ends: 803 [2025-02-08 00:15:29,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:15:29,024 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 1374 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:29,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 3927 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-02-08 00:15:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 626. [2025-02-08 00:15:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4768) internal successors, (923), 625 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 923 transitions. [2025-02-08 00:15:29,035 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 923 transitions. Word has length 57 [2025-02-08 00:15:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:29,035 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 923 transitions. [2025-02-08 00:15:29,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 923 transitions. [2025-02-08 00:15:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 00:15:29,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:29,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:15:29,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:29,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -894295524, now seen corresponding path program 1 times [2025-02-08 00:15:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:29,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065320761] [2025-02-08 00:15:29,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:29,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 00:15:29,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 00:15:29,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:29,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:29,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065320761] [2025-02-08 00:15:29,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065320761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:29,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948204974] [2025-02-08 00:15:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:29,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:29,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:29,234 INFO L87 Difference]: Start difference. First operand 626 states and 923 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:29,621 INFO L93 Difference]: Finished difference Result 1181 states and 1740 transitions. [2025-02-08 00:15:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:29,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-08 00:15:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:29,624 INFO L225 Difference]: With dead ends: 1181 [2025-02-08 00:15:29,624 INFO L226 Difference]: Without dead ends: 634 [2025-02-08 00:15:29,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:29,625 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 781 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:29,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2643 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-08 00:15:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 626. [2025-02-08 00:15:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4768) internal successors, (923), 625 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 923 transitions. [2025-02-08 00:15:29,636 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 923 transitions. Word has length 57 [2025-02-08 00:15:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:29,636 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 923 transitions. [2025-02-08 00:15:29,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 923 transitions. [2025-02-08 00:15:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 00:15:29,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:29,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:15:29,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:29,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1847623674, now seen corresponding path program 1 times [2025-02-08 00:15:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728414282] [2025-02-08 00:15:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:29,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 00:15:29,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 00:15:29,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:29,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:29,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:29,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728414282] [2025-02-08 00:15:29,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728414282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:29,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:29,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952363883] [2025-02-08 00:15:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:29,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:29,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:29,863 INFO L87 Difference]: Start difference. First operand 626 states and 923 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:30,403 INFO L93 Difference]: Finished difference Result 1396 states and 2051 transitions. [2025-02-08 00:15:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-08 00:15:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:30,406 INFO L225 Difference]: With dead ends: 1396 [2025-02-08 00:15:30,406 INFO L226 Difference]: Without dead ends: 849 [2025-02-08 00:15:30,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:30,407 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1057 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:30,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 3184 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-08 00:15:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 626. [2025-02-08 00:15:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4768) internal successors, (923), 625 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 923 transitions. [2025-02-08 00:15:30,417 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 923 transitions. Word has length 58 [2025-02-08 00:15:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:30,417 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 923 transitions. [2025-02-08 00:15:30,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 923 transitions. [2025-02-08 00:15:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 00:15:30,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:30,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:30,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:15:30,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:30,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:30,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2105834726, now seen corresponding path program 1 times [2025-02-08 00:15:30,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:30,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018336072] [2025-02-08 00:15:30,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:30,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 00:15:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 00:15:30,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:30,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018336072] [2025-02-08 00:15:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018336072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280071037] [2025-02-08 00:15:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:30,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:30,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:30,566 INFO L87 Difference]: Start difference. First operand 626 states and 923 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:30,956 INFO L93 Difference]: Finished difference Result 1308 states and 1925 transitions. [2025-02-08 00:15:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-08 00:15:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:30,959 INFO L225 Difference]: With dead ends: 1308 [2025-02-08 00:15:30,959 INFO L226 Difference]: Without dead ends: 747 [2025-02-08 00:15:30,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:30,960 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 256 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:30,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2475 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-02-08 00:15:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 626. [2025-02-08 00:15:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4736) internal successors, (921), 625 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 921 transitions. [2025-02-08 00:15:30,970 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 921 transitions. Word has length 59 [2025-02-08 00:15:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:30,970 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 921 transitions. [2025-02-08 00:15:30,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 921 transitions. [2025-02-08 00:15:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 00:15:30,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:30,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:15:30,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash 327470790, now seen corresponding path program 1 times [2025-02-08 00:15:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582466805] [2025-02-08 00:15:30,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 00:15:31,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 00:15:31,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:31,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582466805] [2025-02-08 00:15:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582466805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332891569] [2025-02-08 00:15:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:31,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:31,094 INFO L87 Difference]: Start difference. First operand 626 states and 921 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:31,400 INFO L93 Difference]: Finished difference Result 1272 states and 1873 transitions. [2025-02-08 00:15:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-08 00:15:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:31,402 INFO L225 Difference]: With dead ends: 1272 [2025-02-08 00:15:31,402 INFO L226 Difference]: Without dead ends: 707 [2025-02-08 00:15:31,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:31,403 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 232 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:31,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 2576 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-02-08 00:15:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 601. [2025-02-08 00:15:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4766666666666666) internal successors, (886), 600 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 886 transitions. [2025-02-08 00:15:31,413 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 886 transitions. Word has length 60 [2025-02-08 00:15:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:31,413 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 886 transitions. [2025-02-08 00:15:31,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 886 transitions. [2025-02-08 00:15:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-08 00:15:31,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:31,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:31,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:15:31,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1993169362, now seen corresponding path program 1 times [2025-02-08 00:15:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901739494] [2025-02-08 00:15:31,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:31,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-08 00:15:33,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 00:15:33,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:33,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901739494] [2025-02-08 00:15:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901739494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:35,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:35,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720031721] [2025-02-08 00:15:35,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:35,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:35,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:35,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:35,378 INFO L87 Difference]: Start difference. First operand 601 states and 886 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:35,846 INFO L93 Difference]: Finished difference Result 1284 states and 1898 transitions. [2025-02-08 00:15:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 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 303 [2025-02-08 00:15:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:35,849 INFO L225 Difference]: With dead ends: 1284 [2025-02-08 00:15:35,849 INFO L226 Difference]: Without dead ends: 761 [2025-02-08 00:15:35,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:35,850 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 1299 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:35,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1874 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-08 00:15:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 609. [2025-02-08 00:15:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.4703947368421053) internal successors, (894), 608 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 894 transitions. [2025-02-08 00:15:35,861 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 894 transitions. Word has length 303 [2025-02-08 00:15:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:35,861 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 894 transitions. [2025-02-08 00:15:35,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 894 transitions. [2025-02-08 00:15:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-08 00:15:35,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:35,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:15:35,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:35,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1200268548, now seen corresponding path program 1 times [2025-02-08 00:15:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764425279] [2025-02-08 00:15:35,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:35,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-08 00:15:37,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-08 00:15:37,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:37,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764425279] [2025-02-08 00:15:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764425279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:38,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:38,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072067420] [2025-02-08 00:15:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:38,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:38,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:38,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:38,892 INFO L87 Difference]: Start difference. First operand 609 states and 894 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:39,387 INFO L93 Difference]: Finished difference Result 1284 states and 1897 transitions. [2025-02-08 00:15:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2025-02-08 00:15:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:39,390 INFO L225 Difference]: With dead ends: 1284 [2025-02-08 00:15:39,390 INFO L226 Difference]: Without dead ends: 761 [2025-02-08 00:15:39,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:39,391 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1270 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:39,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1886 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-08 00:15:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 610. [2025-02-08 00:15:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.4696223316912973) internal successors, (895), 609 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 895 transitions. [2025-02-08 00:15:39,401 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 895 transitions. Word has length 304 [2025-02-08 00:15:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:39,401 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 895 transitions. [2025-02-08 00:15:39,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 895 transitions. [2025-02-08 00:15:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-08 00:15:39,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:39,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:39,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:15:39,404 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:39,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash -580819574, now seen corresponding path program 1 times [2025-02-08 00:15:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106160156] [2025-02-08 00:15:39,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:39,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-08 00:15:42,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-08 00:15:42,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:42,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:43,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:43,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106160156] [2025-02-08 00:15:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106160156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:15:43,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944225122] [2025-02-08 00:15:43,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:43,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:43,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:43,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:43,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:15:44,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-08 00:15:45,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-08 00:15:45,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:45,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:45,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 00:15:45,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:46,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:15:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:47,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944225122] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:15:47,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:15:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2025-02-08 00:15:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515529395] [2025-02-08 00:15:47,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:15:47,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 00:15:47,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:47,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 00:15:47,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:15:47,573 INFO L87 Difference]: Start difference. First operand 610 states and 895 transitions. Second operand has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 17 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:48,614 INFO L93 Difference]: Finished difference Result 1850 states and 2735 transitions. [2025-02-08 00:15:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:15:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 17 states have internal predecessors, (897), 0 states have call successors, (0), 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 305 [2025-02-08 00:15:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:48,624 INFO L225 Difference]: With dead ends: 1850 [2025-02-08 00:15:48,624 INFO L226 Difference]: Without dead ends: 1327 [2025-02-08 00:15:48,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:15:48,625 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 4002 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4002 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:48,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4002 Valid, 3124 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:15:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-02-08 00:15:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1045. [2025-02-08 00:15:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 1.4770114942528736) internal successors, (1542), 1044 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1542 transitions. [2025-02-08 00:15:48,643 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1542 transitions. Word has length 305 [2025-02-08 00:15:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:48,643 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1542 transitions. [2025-02-08 00:15:48,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 17 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1542 transitions. [2025-02-08 00:15:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-08 00:15:48,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:48,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:48,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:15:48,848 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,SelfDestructingSolverStorable15 [2025-02-08 00:15:48,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:48,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1730730397, now seen corresponding path program 1 times [2025-02-08 00:15:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916931129] [2025-02-08 00:15:48,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:48,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 00:15:51,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 00:15:51,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:54,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916931129] [2025-02-08 00:15:54,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916931129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:15:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864027218] [2025-02-08 00:15:54,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:54,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:54,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:54,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:54,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:15:54,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 00:15:55,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 00:15:55,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:55,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:55,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 00:15:55,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:55,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:15:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864027218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:15:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-02-08 00:15:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485057301] [2025-02-08 00:15:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:55,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:15:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:55,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:15:55,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:15:55,902 INFO L87 Difference]: Start difference. First operand 1045 states and 1542 transitions. Second operand has 9 states, 9 states have (on average 34.0) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:56,694 INFO L93 Difference]: Finished difference Result 2212 states and 3255 transitions. [2025-02-08 00:15:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:15:56,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.0) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 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 306 [2025-02-08 00:15:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:56,698 INFO L225 Difference]: With dead ends: 2212 [2025-02-08 00:15:56,698 INFO L226 Difference]: Without dead ends: 1254 [2025-02-08 00:15:56,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:15:56,704 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 1102 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:56,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 3108 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:15:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-02-08 00:15:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1144. [2025-02-08 00:15:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4601924759405074) internal successors, (1669), 1143 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1669 transitions. [2025-02-08 00:15:56,733 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1669 transitions. Word has length 306 [2025-02-08 00:15:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:56,733 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1669 transitions. [2025-02-08 00:15:56,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.0) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1669 transitions. [2025-02-08 00:15:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-08 00:15:56,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:56,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:56,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:15:56,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 00:15:56,937 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1266251843, now seen corresponding path program 1 times [2025-02-08 00:15:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308383853] [2025-02-08 00:15:56,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:57,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 00:15:59,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 00:15:59,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308383853] [2025-02-08 00:16:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308383853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:16:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145851247] [2025-02-08 00:16:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:16:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:00,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:16:00,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:16:00,369 INFO L87 Difference]: Start difference. First operand 1144 states and 1669 transitions. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:01,291 INFO L93 Difference]: Finished difference Result 2278 states and 3340 transitions. [2025-02-08 00:16:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:16:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 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 307 [2025-02-08 00:16:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:01,295 INFO L225 Difference]: With dead ends: 2278 [2025-02-08 00:16:01,295 INFO L226 Difference]: Without dead ends: 1249 [2025-02-08 00:16:01,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:16:01,300 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 965 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:01,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 3451 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:16:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-02-08 00:16:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1144. [2025-02-08 00:16:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.458442694663167) internal successors, (1667), 1143 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1667 transitions. [2025-02-08 00:16:01,336 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1667 transitions. Word has length 307 [2025-02-08 00:16:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1667 transitions. [2025-02-08 00:16:01,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1667 transitions. [2025-02-08 00:16:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-08 00:16:01,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:01,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:01,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:16:01,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:01,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1819333550, now seen corresponding path program 1 times [2025-02-08 00:16:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:01,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101094233] [2025-02-08 00:16:01,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:01,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 00:16:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 00:16:03,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:03,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 00:16:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101094233] [2025-02-08 00:16:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101094233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:16:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862658817] [2025-02-08 00:16:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:16:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:03,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:16:03,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:16:03,958 INFO L87 Difference]: Start difference. First operand 1144 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:04,341 INFO L93 Difference]: Finished difference Result 2344 states and 3424 transitions. [2025-02-08 00:16:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:16:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 307 [2025-02-08 00:16:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:04,344 INFO L225 Difference]: With dead ends: 2344 [2025-02-08 00:16:04,344 INFO L226 Difference]: Without dead ends: 1287 [2025-02-08 00:16:04,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:04,349 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 234 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:04,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 2481 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:16:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-02-08 00:16:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1144. [2025-02-08 00:16:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.457567804024497) internal successors, (1666), 1143 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1666 transitions. [2025-02-08 00:16:04,380 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1666 transitions. Word has length 307 [2025-02-08 00:16:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:04,381 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1666 transitions. [2025-02-08 00:16:04,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1666 transitions. [2025-02-08 00:16:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-08 00:16:04,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:04,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:16:04,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1207055896, now seen corresponding path program 1 times [2025-02-08 00:16:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751618898] [2025-02-08 00:16:04,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:04,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:04,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 00:16:06,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 00:16:06,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:06,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751618898] [2025-02-08 00:16:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751618898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:16:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104536844] [2025-02-08 00:16:09,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:09,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:09,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:09,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:16:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:16:10,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 00:16:11,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 00:16:11,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:11,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:11,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 00:16:11,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:11,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:16:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104536844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:11,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:16:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2025-02-08 00:16:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077763252] [2025-02-08 00:16:11,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:11,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:16:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:11,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:16:11,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:16:11,406 INFO L87 Difference]: Start difference. First operand 1144 states and 1666 transitions. Second operand has 8 states, 8 states have (on average 38.5) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:11,966 INFO L93 Difference]: Finished difference Result 2555 states and 3754 transitions. [2025-02-08 00:16:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:16:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 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 308 [2025-02-08 00:16:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:11,970 INFO L225 Difference]: With dead ends: 2555 [2025-02-08 00:16:11,970 INFO L226 Difference]: Without dead ends: 1528 [2025-02-08 00:16:11,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-02-08 00:16:11,971 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1322 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:11,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 2290 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:16:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-02-08 00:16:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1154. [2025-02-08 00:16:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.4553339115351258) internal successors, (1678), 1153 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1678 transitions. [2025-02-08 00:16:11,988 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1678 transitions. Word has length 308 [2025-02-08 00:16:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:11,989 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1678 transitions. [2025-02-08 00:16:11,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1678 transitions. [2025-02-08 00:16:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-08 00:16:11,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:11,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:12,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 00:16:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:12,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1485462360, now seen corresponding path program 1 times [2025-02-08 00:16:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414918556] [2025-02-08 00:16:12,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 00:16:14,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 00:16:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414918556] [2025-02-08 00:16:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414918556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:16:14,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:16:14,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:16:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201235438] [2025-02-08 00:16:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:16:14,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:16:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:14,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:16:14,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:16:14,920 INFO L87 Difference]: Start difference. First operand 1154 states and 1678 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:16:15,474 INFO L93 Difference]: Finished difference Result 2195 states and 3208 transitions. [2025-02-08 00:16:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:16:15,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 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 309 [2025-02-08 00:16:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:16:15,477 INFO L225 Difference]: With dead ends: 2195 [2025-02-08 00:16:15,477 INFO L226 Difference]: Without dead ends: 1158 [2025-02-08 00:16:15,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:16:15,479 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 714 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:16:15,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2133 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:16:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-08 00:16:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2025-02-08 00:16:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.4545454545454546) internal successors, (1680), 1155 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1680 transitions. [2025-02-08 00:16:15,490 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1680 transitions. Word has length 309 [2025-02-08 00:16:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:16:15,491 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1680 transitions. [2025-02-08 00:16:15,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:16:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1680 transitions. [2025-02-08 00:16:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-08 00:16:15,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:16:15,493 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:16:15,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:16:15,493 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:16:15,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:16:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -34294461, now seen corresponding path program 1 times [2025-02-08 00:16:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:16:15,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446571263] [2025-02-08 00:16:15,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:16:15,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 00:16:18,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 00:16:18,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:18,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:16:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446571263] [2025-02-08 00:16:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446571263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:16:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778548549] [2025-02-08 00:16:20,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:16:20,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:16:20,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:16:20,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:16:20,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 00:16:21,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-08 00:16:22,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-08 00:16:22,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:16:22,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:16:22,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-02-08 00:16:22,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:16:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:24,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:16:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:16:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778548549] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:16:30,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:16:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24, 21] total 52 [2025-02-08 00:16:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954394965] [2025-02-08 00:16:30,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:16:30,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-08 00:16:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:16:30,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-08 00:16:30,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2503, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 00:16:30,851 INFO L87 Difference]: Start difference. First operand 1156 states and 1680 transitions. Second operand has 53 states, 53 states have (on average 15.415094339622641) internal successors, (817), 52 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)