./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65159196aa732cf84d788dcb31500c216d665703806e14a7c6f7047ab62d591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:26:00,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:26:00,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:26:00,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:26:00,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:26:00,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:26:00,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:26:00,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:26:00,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:26:00,162 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:26:00,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:26:00,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:26:00,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:26:00,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:26:00,164 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:26:00,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:26:00,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:26:00,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:26:00,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:26:00,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:26:00,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:26:00,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:26:00,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:26:00,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:26:00,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:26:00,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:26:00,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:26:00,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:26:00,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65159196aa732cf84d788dcb31500c216d665703806e14a7c6f7047ab62d591b [2025-01-09 04:26:00,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:26:00,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:26:00,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:26:00,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:26:00,420 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:26:00,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2025-01-09 04:26:01,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b312a02d4/078edde448f44a24bff9424c83162d61/FLAG2f68d4cca [2025-01-09 04:26:01,923 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:26:01,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2025-01-09 04:26:01,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b312a02d4/078edde448f44a24bff9424c83162d61/FLAG2f68d4cca [2025-01-09 04:26:02,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b312a02d4/078edde448f44a24bff9424c83162d61 [2025-01-09 04:26:02,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:26:02,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:26:02,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:26:02,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:26:02,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:26:02,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f93efe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02, skipping insertion in model container [2025-01-09 04:26:02,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:26:02,431 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/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c[15075,15088] [2025-01-09 04:26:02,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:26:02,449 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:26:02,494 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/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c[15075,15088] [2025-01-09 04:26:02,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:26:02,513 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:26:02,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02 WrapperNode [2025-01-09 04:26:02,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:26:02,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:26:02,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:26:02,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:26:02,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,542 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 395 [2025-01-09 04:26:02,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:26:02,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:26:02,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:26:02,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:26:02,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:26:02,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:26:02,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:26:02,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:26:02,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:26:02,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (1/1) ... [2025-01-09 04:26:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:26:02,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:02,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:26:02,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:26:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:26:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:26:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:26:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:26:02,677 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:26:02,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:26:03,015 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 04:26:03,015 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:26:03,022 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:26:03,023 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:26:03,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:26:03 BoogieIcfgContainer [2025-01-09 04:26:03,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:26:03,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:26:03,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:26:03,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:26:03,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:26:02" (1/3) ... [2025-01-09 04:26:03,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15de1b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:26:03, skipping insertion in model container [2025-01-09 04:26:03,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:26:02" (2/3) ... [2025-01-09 04:26:03,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15de1b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:26:03, skipping insertion in model container [2025-01-09 04:26:03,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:26:03" (3/3) ... [2025-01-09 04:26:03,030 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2025-01-09 04:26:03,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:26:03,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c that has 1 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:26:03,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:26:03,092 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;@375fb42a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:26:03,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:26:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.768421052631579) internal successors, (168), 96 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:26:03,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:03,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:03,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:03,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1803095490, now seen corresponding path program 1 times [2025-01-09 04:26:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850561297] [2025-01-09 04:26:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:03,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:26:03,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:26:03,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:03,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850561297] [2025-01-09 04:26:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850561297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:26:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427516805] [2025-01-09 04:26:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:03,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:26:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:03,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:26:03,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:26:03,347 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.768421052631579) internal successors, (168), 96 states have internal predecessors, (168), 0 states have call successors, (0), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:03,359 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2025-01-09 04:26:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:26:03,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 04:26:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:03,365 INFO L225 Difference]: With dead ends: 149 [2025-01-09 04:26:03,365 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 04:26:03,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:26:03,369 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:03,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 04:26:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 04:26:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7526881720430108) internal successors, (163), 93 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 163 transitions. [2025-01-09 04:26:03,406 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 163 transitions. Word has length 25 [2025-01-09 04:26:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 163 transitions. [2025-01-09 04:26:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 163 transitions. [2025-01-09 04:26:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:26:03,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:03,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:03,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:26:03,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:03,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1674223356, now seen corresponding path program 1 times [2025-01-09 04:26:03,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053807] [2025-01-09 04:26:03,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:03,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:26:03,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:26:03,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:03,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053807] [2025-01-09 04:26:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:03,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:26:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292837293] [2025-01-09 04:26:03,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:03,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:26:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:03,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:26:03,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:26:03,599 INFO L87 Difference]: Start difference. First operand 94 states and 163 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:03,687 INFO L93 Difference]: Finished difference Result 146 states and 244 transitions. [2025-01-09 04:26:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:26:03,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 04:26:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:03,688 INFO L225 Difference]: With dead ends: 146 [2025-01-09 04:26:03,688 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 04:26:03,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 04:26:03,689 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:03,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 04:26:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 04:26:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 123 transitions. [2025-01-09 04:26:03,693 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 123 transitions. Word has length 25 [2025-01-09 04:26:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:03,693 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 123 transitions. [2025-01-09 04:26:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2025-01-09 04:26:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:26:03,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:03,694 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, 1, 1, 1, 1] [2025-01-09 04:26:03,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:26:03,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1129367507, now seen corresponding path program 1 times [2025-01-09 04:26:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352541544] [2025-01-09 04:26:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:03,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:26:03,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:26:03,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352541544] [2025-01-09 04:26:03,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352541544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:03,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997910239] [2025-01-09 04:26:03,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:03,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:03,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:03,960 INFO L87 Difference]: Start difference. First operand 94 states and 123 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:04,223 INFO L93 Difference]: Finished difference Result 670 states and 1047 transitions. [2025-01-09 04:26:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:26:04,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:26:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:04,227 INFO L225 Difference]: With dead ends: 670 [2025-01-09 04:26:04,230 INFO L226 Difference]: Without dead ends: 622 [2025-01-09 04:26:04,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:26:04,231 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1066 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:04,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 2130 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-01-09 04:26:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 140. [2025-01-09 04:26:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 139 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2025-01-09 04:26:04,249 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 64 [2025-01-09 04:26:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 197 transitions. [2025-01-09 04:26:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2025-01-09 04:26:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:26:04,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:04,250 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:26:04,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash -111142819, now seen corresponding path program 1 times [2025-01-09 04:26:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645877494] [2025-01-09 04:26:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:04,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:26:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:26:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645877494] [2025-01-09 04:26:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645877494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348232322] [2025-01-09 04:26:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:04,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:04,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:04,329 INFO L87 Difference]: Start difference. First operand 140 states and 197 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:04,345 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2025-01-09 04:26:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:26:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:04,346 INFO L225 Difference]: With dead ends: 317 [2025-01-09 04:26:04,346 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 04:26:04,347 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-01-09 04:26:04,347 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:04,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 193 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 04:26:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-01-09 04:26:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4772727272727273) internal successors, (325), 220 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2025-01-09 04:26:04,355 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 66 [2025-01-09 04:26:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:04,355 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2025-01-09 04:26:04,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2025-01-09 04:26:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:26:04,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:04,357 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:04,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:26:04,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:04,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash -44649307, now seen corresponding path program 1 times [2025-01-09 04:26:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283128964] [2025-01-09 04:26:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:04,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:26:04,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:26:04,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:04,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283128964] [2025-01-09 04:26:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283128964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:04,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:04,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:04,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600925695] [2025-01-09 04:26:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:04,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:04,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:04,633 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:04,857 INFO L93 Difference]: Finished difference Result 398 states and 605 transitions. [2025-01-09 04:26:04,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:04,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:26:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:04,860 INFO L225 Difference]: With dead ends: 398 [2025-01-09 04:26:04,860 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 04:26:04,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:26:04,861 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 146 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:04,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 483 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 04:26:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-01-09 04:26:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4681818181818183) internal successors, (323), 220 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 323 transitions. [2025-01-09 04:26:04,877 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 323 transitions. Word has length 66 [2025-01-09 04:26:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:04,878 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 323 transitions. [2025-01-09 04:26:04,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2025-01-09 04:26:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:26:04,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:04,882 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:04,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:26:04,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:04,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1798851524, now seen corresponding path program 1 times [2025-01-09 04:26:04,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:04,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372512425] [2025-01-09 04:26:04,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:04,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:26:04,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:26:04,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:04,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372512425] [2025-01-09 04:26:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372512425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:26:05,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851686531] [2025-01-09 04:26:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:26:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:26:05,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:26:05,121 INFO L87 Difference]: Start difference. First operand 221 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:05,140 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2025-01-09 04:26:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:26:05,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:26:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:05,142 INFO L225 Difference]: With dead ends: 229 [2025-01-09 04:26:05,142 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 04:26:05,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 04:26:05,143 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:05,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 04:26:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-01-09 04:26:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-01-09 04:26:05,152 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 67 [2025-01-09 04:26:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:05,152 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-01-09 04:26:05,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-01-09 04:26:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:26:05,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:05,154 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:05,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:26:05,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 280709733, now seen corresponding path program 1 times [2025-01-09 04:26:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625435933] [2025-01-09 04:26:05,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:05,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:26:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:26:05,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:05,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625435933] [2025-01-09 04:26:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625435933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506902591] [2025-01-09 04:26:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:05,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:05,232 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:05,251 INFO L93 Difference]: Finished difference Result 421 states and 629 transitions. [2025-01-09 04:26:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:26:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:05,253 INFO L225 Difference]: With dead ends: 421 [2025-01-09 04:26:05,253 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 04:26:05,253 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-01-09 04:26:05,254 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:05,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 04:26:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-01-09 04:26:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4748427672955975) internal successors, (469), 318 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 469 transitions. [2025-01-09 04:26:05,263 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 469 transitions. Word has length 68 [2025-01-09 04:26:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 469 transitions. [2025-01-09 04:26:05,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 469 transitions. [2025-01-09 04:26:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:26:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:05,265 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:05,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:26:05,265 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:05,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 707480677, now seen corresponding path program 1 times [2025-01-09 04:26:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604558572] [2025-01-09 04:26:05,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:05,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:26:05,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:26:05,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:05,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604558572] [2025-01-09 04:26:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604558572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095315123] [2025-01-09 04:26:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:05,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:05,356 INFO L87 Difference]: Start difference. First operand 319 states and 469 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:05,373 INFO L93 Difference]: Finished difference Result 837 states and 1269 transitions. [2025-01-09 04:26:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:05,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:26:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:05,376 INFO L225 Difference]: With dead ends: 837 [2025-01-09 04:26:05,376 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 04:26:05,376 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-01-09 04:26:05,377 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 63 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:05,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 04:26:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-01-09 04:26:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.4937833037300177) internal successors, (841), 563 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-01-09 04:26:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 841 transitions. [2025-01-09 04:26:05,390 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 841 transitions. Word has length 68 [2025-01-09 04:26:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:05,391 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 841 transitions. [2025-01-09 04:26:05,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 841 transitions. [2025-01-09 04:26:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:26:05,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:05,392 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:26:05,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:05,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1945742693, now seen corresponding path program 1 times [2025-01-09 04:26:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938683082] [2025-01-09 04:26:05,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:05,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:26:05,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:26:05,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:05,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938683082] [2025-01-09 04:26:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938683082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358032398] [2025-01-09 04:26:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:05,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:05,445 INFO L87 Difference]: Start difference. First operand 564 states and 841 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:05,471 INFO L93 Difference]: Finished difference Result 1548 states and 2343 transitions. [2025-01-09 04:26:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:26:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:05,475 INFO L225 Difference]: With dead ends: 1548 [2025-01-09 04:26:05,475 INFO L226 Difference]: Without dead ends: 1032 [2025-01-09 04:26:05,476 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-01-09 04:26:05,476 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:05,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 265 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-01-09 04:26:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1030. [2025-01-09 04:26:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4936831875607386) internal successors, (1537), 1029 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1537 transitions. [2025-01-09 04:26:05,508 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1537 transitions. Word has length 68 [2025-01-09 04:26:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1537 transitions. [2025-01-09 04:26:05,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1537 transitions. [2025-01-09 04:26:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:26:05,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:05,509 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:05,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:26:05,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:05,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash -269726107, now seen corresponding path program 1 times [2025-01-09 04:26:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:05,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734844486] [2025-01-09 04:26:05,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:05,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:26:05,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:26:05,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:05,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734844486] [2025-01-09 04:26:05,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734844486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:05,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459093450] [2025-01-09 04:26:05,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:05,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:05,556 INFO L87 Difference]: Start difference. First operand 1030 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:05,588 INFO L93 Difference]: Finished difference Result 2898 states and 4347 transitions. [2025-01-09 04:26:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:26:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:05,594 INFO L225 Difference]: With dead ends: 2898 [2025-01-09 04:26:05,594 INFO L226 Difference]: Without dead ends: 1916 [2025-01-09 04:26:05,595 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-01-09 04:26:05,595 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:05,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-01-09 04:26:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2025-01-09 04:26:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.480920020909566) internal successors, (2833), 1913 states have internal predecessors, (2833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2833 transitions. [2025-01-09 04:26:05,639 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2833 transitions. Word has length 68 [2025-01-09 04:26:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2833 transitions. [2025-01-09 04:26:05,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2833 transitions. [2025-01-09 04:26:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:26:05,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:05,640 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:26:05,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:05,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1511206757, now seen corresponding path program 1 times [2025-01-09 04:26:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079381847] [2025-01-09 04:26:05,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:26:05,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:26:05,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:05,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079381847] [2025-01-09 04:26:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079381847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288270940] [2025-01-09 04:26:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:05,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:05,685 INFO L87 Difference]: Start difference. First operand 1914 states and 2833 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:05,747 INFO L93 Difference]: Finished difference Result 5454 states and 8067 transitions. [2025-01-09 04:26:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:26:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:05,762 INFO L225 Difference]: With dead ends: 5454 [2025-01-09 04:26:05,762 INFO L226 Difference]: Without dead ends: 3588 [2025-01-09 04:26:05,765 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-01-09 04:26:05,766 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:05,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2025-01-09 04:26:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3586. [2025-01-09 04:26:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.4596931659693166) internal successors, (5233), 3585 states have internal predecessors, (5233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5233 transitions. [2025-01-09 04:26:05,902 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5233 transitions. Word has length 68 [2025-01-09 04:26:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:05,903 INFO L471 AbstractCegarLoop]: Abstraction has 3586 states and 5233 transitions. [2025-01-09 04:26:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5233 transitions. [2025-01-09 04:26:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:26:05,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:05,904 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:05,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:26:05,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:05,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash 443624293, now seen corresponding path program 1 times [2025-01-09 04:26:05,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140943042] [2025-01-09 04:26:05,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:05,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:26:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:26:05,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:05,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140943042] [2025-01-09 04:26:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140943042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:05,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:05,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609555566] [2025-01-09 04:26:05,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:05,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:05,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:05,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:05,953 INFO L87 Difference]: Start difference. First operand 3586 states and 5233 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:06,034 INFO L93 Difference]: Finished difference Result 10278 states and 14931 transitions. [2025-01-09 04:26:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:26:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:06,054 INFO L225 Difference]: With dead ends: 10278 [2025-01-09 04:26:06,054 INFO L226 Difference]: Without dead ends: 6740 [2025-01-09 04:26:06,059 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-01-09 04:26:06,060 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:06,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2025-01-09 04:26:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6738. [2025-01-09 04:26:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6738 states, 6737 states have (on average 1.4322398693780614) internal successors, (9649), 6737 states have internal predecessors, (9649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 9649 transitions. [2025-01-09 04:26:06,270 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 9649 transitions. Word has length 68 [2025-01-09 04:26:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:06,270 INFO L471 AbstractCegarLoop]: Abstraction has 6738 states and 9649 transitions. [2025-01-09 04:26:06,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 9649 transitions. [2025-01-09 04:26:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:26:06,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:06,273 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:06,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:26:06,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:06,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1971691358, now seen corresponding path program 1 times [2025-01-09 04:26:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003054165] [2025-01-09 04:26:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:26:06,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:26:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:26:06,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003054165] [2025-01-09 04:26:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003054165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:06,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:06,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475847618] [2025-01-09 04:26:06,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:06,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:06,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:06,418 INFO L87 Difference]: Start difference. First operand 6738 states and 9649 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:07,075 INFO L93 Difference]: Finished difference Result 46336 states and 66424 transitions. [2025-01-09 04:26:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 89 [2025-01-09 04:26:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:07,169 INFO L225 Difference]: With dead ends: 46336 [2025-01-09 04:26:07,169 INFO L226 Difference]: Without dead ends: 41598 [2025-01-09 04:26:07,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:26:07,191 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 827 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:07,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1072 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41598 states. [2025-01-09 04:26:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41598 to 12466. [2025-01-09 04:26:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 12465 states have (on average 1.4261532290413157) internal successors, (17777), 12465 states have internal predecessors, (17777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 17777 transitions. [2025-01-09 04:26:07,795 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 17777 transitions. Word has length 89 [2025-01-09 04:26:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:07,796 INFO L471 AbstractCegarLoop]: Abstraction has 12466 states and 17777 transitions. [2025-01-09 04:26:07,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 17777 transitions. [2025-01-09 04:26:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:26:07,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:07,800 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:26:07,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1896504994, now seen corresponding path program 1 times [2025-01-09 04:26:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:07,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892364256] [2025-01-09 04:26:07,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:07,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:26:07,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:26:07,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:07,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:26:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892364256] [2025-01-09 04:26:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892364256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:07,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344058748] [2025-01-09 04:26:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:07,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:07,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:07,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:07,965 INFO L87 Difference]: Start difference. First operand 12466 states and 17777 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:08,654 INFO L93 Difference]: Finished difference Result 53024 states and 75960 transitions. [2025-01-09 04:26:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:26:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:08,725 INFO L225 Difference]: With dead ends: 53024 [2025-01-09 04:26:08,725 INFO L226 Difference]: Without dead ends: 46334 [2025-01-09 04:26:08,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:26:08,739 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 883 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:08,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1112 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46334 states. [2025-01-09 04:26:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46334 to 21522. [2025-01-09 04:26:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21522 states, 21521 states have (on average 1.4222852097950838) internal successors, (30609), 21521 states have internal predecessors, (30609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21522 states to 21522 states and 30609 transitions. [2025-01-09 04:26:09,453 INFO L78 Accepts]: Start accepts. Automaton has 21522 states and 30609 transitions. Word has length 89 [2025-01-09 04:26:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:09,453 INFO L471 AbstractCegarLoop]: Abstraction has 21522 states and 30609 transitions. [2025-01-09 04:26:09,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 21522 states and 30609 transitions. [2025-01-09 04:26:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:26:09,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:09,457 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:09,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:26:09,457 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:09,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -658242978, now seen corresponding path program 1 times [2025-01-09 04:26:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909370169] [2025-01-09 04:26:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:09,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:26:09,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:26:09,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:09,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:26:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909370169] [2025-01-09 04:26:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909370169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690161284] [2025-01-09 04:26:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:09,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:09,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:09,634 INFO L87 Difference]: Start difference. First operand 21522 states and 30609 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:10,456 INFO L93 Difference]: Finished difference Result 59712 states and 85464 transitions. [2025-01-09 04:26:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:10,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 89 [2025-01-09 04:26:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:10,544 INFO L225 Difference]: With dead ends: 59712 [2025-01-09 04:26:10,544 INFO L226 Difference]: Without dead ends: 53022 [2025-01-09 04:26:10,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:26:10,561 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 929 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:10,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1041 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53022 states. [2025-01-09 04:26:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53022 to 28210. [2025-01-09 04:26:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28210 states, 28209 states have (on average 1.4219929809635223) internal successors, (40113), 28209 states have internal predecessors, (40113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28210 states to 28210 states and 40113 transitions. [2025-01-09 04:26:11,336 INFO L78 Accepts]: Start accepts. Automaton has 28210 states and 40113 transitions. Word has length 89 [2025-01-09 04:26:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:11,336 INFO L471 AbstractCegarLoop]: Abstraction has 28210 states and 40113 transitions. [2025-01-09 04:26:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28210 states and 40113 transitions. [2025-01-09 04:26:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:26:11,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:11,341 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:11,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:26:11,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:11,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1421255518, now seen corresponding path program 1 times [2025-01-09 04:26:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652230455] [2025-01-09 04:26:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:11,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:26:11,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:26:11,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:11,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:26:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652230455] [2025-01-09 04:26:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652230455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:11,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505804213] [2025-01-09 04:26:11,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:11,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:11,518 INFO L87 Difference]: Start difference. First operand 28210 states and 40113 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:12,545 INFO L93 Difference]: Finished difference Result 66400 states and 94968 transitions. [2025-01-09 04:26:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:12,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:26:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:12,631 INFO L225 Difference]: With dead ends: 66400 [2025-01-09 04:26:12,631 INFO L226 Difference]: Without dead ends: 59710 [2025-01-09 04:26:12,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:26:12,648 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 974 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:12,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1062 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59710 states. [2025-01-09 04:26:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59710 to 34898. [2025-01-09 04:26:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34898 states, 34897 states have (on average 1.4218127632747801) internal successors, (49617), 34897 states have internal predecessors, (49617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34898 states to 34898 states and 49617 transitions. [2025-01-09 04:26:13,745 INFO L78 Accepts]: Start accepts. Automaton has 34898 states and 49617 transitions. Word has length 89 [2025-01-09 04:26:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:13,745 INFO L471 AbstractCegarLoop]: Abstraction has 34898 states and 49617 transitions. [2025-01-09 04:26:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34898 states and 49617 transitions. [2025-01-09 04:26:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:26:13,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:13,749 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:13,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:26:13,749 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:13,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1092778914, now seen corresponding path program 1 times [2025-01-09 04:26:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196775129] [2025-01-09 04:26:13,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:13,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:26:13,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:26:13,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:13,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:26:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196775129] [2025-01-09 04:26:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196775129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865672524] [2025-01-09 04:26:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:13,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:13,909 INFO L87 Difference]: Start difference. First operand 34898 states and 49617 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:15,057 INFO L93 Difference]: Finished difference Result 73088 states and 104472 transitions. [2025-01-09 04:26:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:26:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:15,128 INFO L225 Difference]: With dead ends: 73088 [2025-01-09 04:26:15,129 INFO L226 Difference]: Without dead ends: 66398 [2025-01-09 04:26:15,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:26:15,144 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 891 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:15,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1120 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66398 states. [2025-01-09 04:26:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66398 to 41586. [2025-01-09 04:26:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41586 states, 41585 states have (on average 1.4216905134062763) internal successors, (59121), 41585 states have internal predecessors, (59121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41586 states to 41586 states and 59121 transitions. [2025-01-09 04:26:15,924 INFO L78 Accepts]: Start accepts. Automaton has 41586 states and 59121 transitions. Word has length 89 [2025-01-09 04:26:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:15,924 INFO L471 AbstractCegarLoop]: Abstraction has 41586 states and 59121 transitions. [2025-01-09 04:26:15,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 41586 states and 59121 transitions. [2025-01-09 04:26:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:26:15,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:15,928 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:26:15,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2134605918, now seen corresponding path program 1 times [2025-01-09 04:26:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:15,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509239819] [2025-01-09 04:26:15,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:15,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:26:15,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:26:15,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:15,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:26:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509239819] [2025-01-09 04:26:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509239819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:26:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184761402] [2025-01-09 04:26:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:26:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:16,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:26:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:26:16,050 INFO L87 Difference]: Start difference. First operand 41586 states and 59121 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:17,410 INFO L93 Difference]: Finished difference Result 79776 states and 113976 transitions. [2025-01-09 04:26:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:26:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 04:26:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:17,498 INFO L225 Difference]: With dead ends: 79776 [2025-01-09 04:26:17,498 INFO L226 Difference]: Without dead ends: 73086 [2025-01-09 04:26:17,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:26:17,517 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 827 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:17,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1280 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:26:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73086 states. [2025-01-09 04:26:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73086 to 48274. [2025-01-09 04:26:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48274 states, 48273 states have (on average 1.421602137841029) internal successors, (68625), 48273 states have internal predecessors, (68625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 68625 transitions. [2025-01-09 04:26:19,085 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 68625 transitions. Word has length 89 [2025-01-09 04:26:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:19,085 INFO L471 AbstractCegarLoop]: Abstraction has 48274 states and 68625 transitions. [2025-01-09 04:26:19,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 68625 transitions. [2025-01-09 04:26:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:26:19,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:19,090 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:19,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:26:19,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -762797932, now seen corresponding path program 1 times [2025-01-09 04:26:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869536176] [2025-01-09 04:26:19,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:19,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:26:19,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:26:19,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869536176] [2025-01-09 04:26:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869536176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:19,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004137403] [2025-01-09 04:26:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:19,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:19,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:19,174 INFO L87 Difference]: Start difference. First operand 48274 states and 68625 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:20,182 INFO L93 Difference]: Finished difference Result 96502 states and 137203 transitions. [2025-01-09 04:26:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 04:26:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:20,240 INFO L225 Difference]: With dead ends: 96502 [2025-01-09 04:26:20,241 INFO L226 Difference]: Without dead ends: 48276 [2025-01-09 04:26:20,281 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-01-09 04:26:20,282 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:20,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 276 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48276 states. [2025-01-09 04:26:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48276 to 48274. [2025-01-09 04:26:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48274 states, 48273 states have (on average 1.4073498643133844) internal successors, (67937), 48273 states have internal predecessors, (67937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 67937 transitions. [2025-01-09 04:26:21,446 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 67937 transitions. Word has length 90 [2025-01-09 04:26:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:21,446 INFO L471 AbstractCegarLoop]: Abstraction has 48274 states and 67937 transitions. [2025-01-09 04:26:21,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 67937 transitions. [2025-01-09 04:26:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:26:21,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:21,449 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:21,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:26:21,449 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:21,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:21,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1307686038, now seen corresponding path program 1 times [2025-01-09 04:26:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694999298] [2025-01-09 04:26:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:21,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:26:21,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:26:21,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:21,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694999298] [2025-01-09 04:26:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694999298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276459024] [2025-01-09 04:26:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:21,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:21,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:21,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:21,636 INFO L87 Difference]: Start difference. First operand 48274 states and 67937 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:21,891 INFO L93 Difference]: Finished difference Result 66059 states and 93161 transitions. [2025-01-09 04:26:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-09 04:26:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:21,912 INFO L225 Difference]: With dead ends: 66059 [2025-01-09 04:26:21,913 INFO L226 Difference]: Without dead ends: 17833 [2025-01-09 04:26:21,940 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-01-09 04:26:21,941 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:21,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2025-01-09 04:26:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 17825. [2025-01-09 04:26:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17824 states have (on average 1.4039497307001796) internal successors, (25024), 17824 states have internal predecessors, (25024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 25024 transitions. [2025-01-09 04:26:22,245 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 25024 transitions. Word has length 91 [2025-01-09 04:26:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:22,245 INFO L471 AbstractCegarLoop]: Abstraction has 17825 states and 25024 transitions. [2025-01-09 04:26:22,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 25024 transitions. [2025-01-09 04:26:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:26:22,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:22,248 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:22,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:26:22,248 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2006500922, now seen corresponding path program 1 times [2025-01-09 04:26:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481136663] [2025-01-09 04:26:22,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:22,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:26:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:26:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:22,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:22,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481136663] [2025-01-09 04:26:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481136663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:22,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:22,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129099548] [2025-01-09 04:26:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:22,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:22,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:22,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:22,320 INFO L87 Difference]: Start difference. First operand 17825 states and 25024 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:22,452 INFO L93 Difference]: Finished difference Result 26709 states and 37506 transitions. [2025-01-09 04:26:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:26:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:22,462 INFO L225 Difference]: With dead ends: 26709 [2025-01-09 04:26:22,462 INFO L226 Difference]: Without dead ends: 8947 [2025-01-09 04:26:22,472 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-01-09 04:26:22,473 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 49 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8947 states. [2025-01-09 04:26:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8947 to 8945. [2025-01-09 04:26:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8945 states, 8944 states have (on average 1.389087656529517) internal successors, (12424), 8944 states have internal predecessors, (12424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8945 states to 8945 states and 12424 transitions. [2025-01-09 04:26:22,624 INFO L78 Accepts]: Start accepts. Automaton has 8945 states and 12424 transitions. Word has length 92 [2025-01-09 04:26:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 8945 states and 12424 transitions. [2025-01-09 04:26:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 8945 states and 12424 transitions. [2025-01-09 04:26:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:26:22,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:22,626 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:26:22,626 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:22,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1465420152, now seen corresponding path program 1 times [2025-01-09 04:26:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42071309] [2025-01-09 04:26:22,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:22,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:26:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:26:22,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:22,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42071309] [2025-01-09 04:26:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42071309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517335449] [2025-01-09 04:26:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:22,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:22,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:22,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:22,707 INFO L87 Difference]: Start difference. First operand 8945 states and 12424 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:22,860 INFO L93 Difference]: Finished difference Result 13389 states and 18606 transitions. [2025-01-09 04:26:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:22,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 04:26:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:22,865 INFO L225 Difference]: With dead ends: 13389 [2025-01-09 04:26:22,865 INFO L226 Difference]: Without dead ends: 4507 [2025-01-09 04:26:22,868 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-01-09 04:26:22,869 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:22,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 237 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-01-09 04:26:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4505. [2025-01-09 04:26:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4505 states, 4504 states have (on average 1.3730017761989344) internal successors, (6184), 4504 states have internal predecessors, (6184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 6184 transitions. [2025-01-09 04:26:22,936 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 6184 transitions. Word has length 94 [2025-01-09 04:26:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:22,937 INFO L471 AbstractCegarLoop]: Abstraction has 4505 states and 6184 transitions. [2025-01-09 04:26:22,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 6184 transitions. [2025-01-09 04:26:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:26:22,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:22,938 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:22,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:26:22,938 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:22,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1285836886, now seen corresponding path program 1 times [2025-01-09 04:26:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:22,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869316191] [2025-01-09 04:26:22,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:22,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:26:22,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:26:22,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:22,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:23,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869316191] [2025-01-09 04:26:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869316191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:23,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:23,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:23,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3334763] [2025-01-09 04:26:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:23,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:23,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:23,003 INFO L87 Difference]: Start difference. First operand 4505 states and 6184 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:23,038 INFO L93 Difference]: Finished difference Result 6729 states and 9246 transitions. [2025-01-09 04:26:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:26:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:23,041 INFO L225 Difference]: With dead ends: 6729 [2025-01-09 04:26:23,041 INFO L226 Difference]: Without dead ends: 2287 [2025-01-09 04:26:23,043 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-01-09 04:26:23,044 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:23,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-01-09 04:26:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2285. [2025-01-09 04:26:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2284 states have (on average 1.3546409807355517) internal successors, (3094), 2284 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3094 transitions. [2025-01-09 04:26:23,079 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3094 transitions. Word has length 96 [2025-01-09 04:26:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:23,080 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3094 transitions. [2025-01-09 04:26:23,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3094 transitions. [2025-01-09 04:26:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:26:23,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:23,080 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:23,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:26:23,081 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -489173924, now seen corresponding path program 1 times [2025-01-09 04:26:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458863128] [2025-01-09 04:26:23,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:23,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:26:23,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:26:23,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:23,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458863128] [2025-01-09 04:26:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458863128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:26:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:26:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:26:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580038945] [2025-01-09 04:26:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:26:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:26:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:23,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:26:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:26:23,150 INFO L87 Difference]: Start difference. First operand 2285 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:23,171 INFO L93 Difference]: Finished difference Result 3399 states and 4611 transitions. [2025-01-09 04:26:23,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:26:23,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:26:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:23,174 INFO L225 Difference]: With dead ends: 3399 [2025-01-09 04:26:23,174 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 04:26:23,175 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-01-09 04:26:23,176 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:23,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 207 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 04:26:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175. [2025-01-09 04:26:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 1.332197614991482) internal successors, (1564), 1174 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1564 transitions. [2025-01-09 04:26:23,194 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1564 transitions. Word has length 98 [2025-01-09 04:26:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:23,194 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1564 transitions. [2025-01-09 04:26:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1564 transitions. [2025-01-09 04:26:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:26:23,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:23,195 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:23,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:26:23,195 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1331953778, now seen corresponding path program 1 times [2025-01-09 04:26:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706852616] [2025-01-09 04:26:23,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:23,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:26:23,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:26:23,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:23,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:26:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706852616] [2025-01-09 04:26:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706852616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:26:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558557747] [2025-01-09 04:26:23,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:23,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:26:23,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:26:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:26:23,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:26:23,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:23,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:23,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:26:23,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:26:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:26:23,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:26:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:26:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558557747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:26:23,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:26:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-01-09 04:26:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262424199] [2025-01-09 04:26:23,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:26:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:26:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:23,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:26:23,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:26:23,948 INFO L87 Difference]: Start difference. First operand 1175 states and 1564 transitions. Second operand has 9 states, 9 states have (on average 28.444444444444443) internal successors, (256), 9 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:24,053 INFO L93 Difference]: Finished difference Result 3830 states and 5082 transitions. [2025-01-09 04:26:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:26:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.444444444444443) internal successors, (256), 9 states have internal predecessors, (256), 0 states have call successors, (0), 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 100 [2025-01-09 04:26:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:24,057 INFO L225 Difference]: With dead ends: 3830 [2025-01-09 04:26:24,057 INFO L226 Difference]: Without dead ends: 2718 [2025-01-09 04:26:24,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:26:24,059 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 147 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:24,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 590 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:26:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2025-01-09 04:26:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2627. [2025-01-09 04:26:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2626 states have (on average 1.2947448591012947) internal successors, (3400), 2626 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3400 transitions. [2025-01-09 04:26:24,123 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3400 transitions. Word has length 100 [2025-01-09 04:26:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:24,123 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 3400 transitions. [2025-01-09 04:26:24,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.444444444444443) internal successors, (256), 9 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3400 transitions. [2025-01-09 04:26:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:26:24,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:24,124 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:26:24,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:26:24,324 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,SelfDestructingSolverStorable24 [2025-01-09 04:26:24,325 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:24,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1304890404, now seen corresponding path program 1 times [2025-01-09 04:26:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:24,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509701515] [2025-01-09 04:26:24,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:24,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:26:24,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:26:24,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:24,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:24,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509701515] [2025-01-09 04:26:24,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509701515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:26:24,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419728852] [2025-01-09 04:26:24,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:24,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:24,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:26:24,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:26:24,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:26:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:26:24,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:24,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:26:24,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:26:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:25,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:26:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419728852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:26:26,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:26:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 04:26:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371713473] [2025-01-09 04:26:26,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:26:26,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:26:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:26,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:26:26,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:26:26,335 INFO L87 Difference]: Start difference. First operand 2627 states and 3400 transitions. Second operand has 29 states, 29 states have (on average 9.551724137931034) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:28,615 INFO L93 Difference]: Finished difference Result 14689 states and 19407 transitions. [2025-01-09 04:26:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 04:26:28,615 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.551724137931034) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 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 101 [2025-01-09 04:26:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:28,627 INFO L225 Difference]: With dead ends: 14689 [2025-01-09 04:26:28,627 INFO L226 Difference]: Without dead ends: 12212 [2025-01-09 04:26:28,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1016, Invalid=3954, Unknown=0, NotChecked=0, Total=4970 [2025-01-09 04:26:28,633 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3152 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:28,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3152 Valid, 1025 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:26:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2025-01-09 04:26:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 12030. [2025-01-09 04:26:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12030 states, 12029 states have (on average 1.2903815778535206) internal successors, (15522), 12029 states have internal predecessors, (15522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 15522 transitions. [2025-01-09 04:26:28,975 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 15522 transitions. Word has length 101 [2025-01-09 04:26:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:28,975 INFO L471 AbstractCegarLoop]: Abstraction has 12030 states and 15522 transitions. [2025-01-09 04:26:28,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.551724137931034) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 15522 transitions. [2025-01-09 04:26:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:26:28,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:28,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:28,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:26:29,178 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,SelfDestructingSolverStorable25 [2025-01-09 04:26:29,178 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1637969330, now seen corresponding path program 1 times [2025-01-09 04:26:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923524150] [2025-01-09 04:26:29,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:29,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:26:29,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:26:29,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:29,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:29,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923524150] [2025-01-09 04:26:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923524150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:26:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359278144] [2025-01-09 04:26:29,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:29,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:29,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:26:29,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:26:29,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:26:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:26:29,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:29,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:29,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:26:29,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:26:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:30,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:26:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359278144] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:26:31,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:26:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-01-09 04:26:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219797632] [2025-01-09 04:26:31,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:26:31,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 04:26:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:31,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 04:26:31,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:26:31,493 INFO L87 Difference]: Start difference. First operand 12030 states and 15522 transitions. Second operand has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 32 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:33,891 INFO L93 Difference]: Finished difference Result 46068 states and 59823 transitions. [2025-01-09 04:26:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 04:26:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 32 states have internal predecessors, (253), 0 states have call successors, (0), 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 101 [2025-01-09 04:26:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:33,924 INFO L225 Difference]: With dead ends: 46068 [2025-01-09 04:26:33,925 INFO L226 Difference]: Without dead ends: 34398 [2025-01-09 04:26:33,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=883, Invalid=3277, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 04:26:33,935 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2380 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:33,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 871 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:26:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34398 states. [2025-01-09 04:26:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34398 to 34282. [2025-01-09 04:26:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34282 states, 34281 states have (on average 1.279659286485225) internal successors, (43868), 34281 states have internal predecessors, (43868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34282 states to 34282 states and 43868 transitions. [2025-01-09 04:26:34,550 INFO L78 Accepts]: Start accepts. Automaton has 34282 states and 43868 transitions. Word has length 101 [2025-01-09 04:26:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:34,550 INFO L471 AbstractCegarLoop]: Abstraction has 34282 states and 43868 transitions. [2025-01-09 04:26:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 32 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 34282 states and 43868 transitions. [2025-01-09 04:26:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:26:34,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:34,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:34,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:26:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:34,753 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 304695488, now seen corresponding path program 1 times [2025-01-09 04:26:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435581049] [2025-01-09 04:26:34,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:34,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:26:34,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:26:34,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:34,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435581049] [2025-01-09 04:26:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435581049] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:26:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309793571] [2025-01-09 04:26:35,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:35,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:35,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:35,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:26:35,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:26:35,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:26:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:26:35,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:35,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:26:35,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:26:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:35,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:26:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:36,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309793571] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:26:36,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:26:36,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 04:26:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674863778] [2025-01-09 04:26:36,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:26:36,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:26:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:36,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:26:36,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:26:36,385 INFO L87 Difference]: Start difference. First operand 34282 states and 43868 transitions. Second operand has 25 states, 25 states have (on average 11.64) internal successors, (291), 24 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:38,693 INFO L93 Difference]: Finished difference Result 103920 states and 133303 transitions. [2025-01-09 04:26:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 04:26:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.64) internal successors, (291), 24 states have internal predecessors, (291), 0 states have call successors, (0), 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 102 [2025-01-09 04:26:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:38,773 INFO L225 Difference]: With dead ends: 103920 [2025-01-09 04:26:38,773 INFO L226 Difference]: Without dead ends: 70934 [2025-01-09 04:26:38,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=667, Invalid=2413, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 04:26:38,809 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2674 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:38,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 1127 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:26:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70934 states. [2025-01-09 04:26:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70934 to 60612. [2025-01-09 04:26:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60612 states, 60611 states have (on average 1.2484532510600386) internal successors, (75670), 60611 states have internal predecessors, (75670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60612 states to 60612 states and 75670 transitions. [2025-01-09 04:26:40,377 INFO L78 Accepts]: Start accepts. Automaton has 60612 states and 75670 transitions. Word has length 102 [2025-01-09 04:26:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:40,377 INFO L471 AbstractCegarLoop]: Abstraction has 60612 states and 75670 transitions. [2025-01-09 04:26:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.64) internal successors, (291), 24 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 60612 states and 75670 transitions. [2025-01-09 04:26:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:26:40,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:40,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:40,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:26:40,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 04:26:40,582 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1600436640, now seen corresponding path program 1 times [2025-01-09 04:26:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391134454] [2025-01-09 04:26:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:40,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:26:40,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:26:40,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:40,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391134454] [2025-01-09 04:26:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391134454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:26:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802702508] [2025-01-09 04:26:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:41,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:41,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:41,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:26:41,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:26:41,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:26:41,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:26:41,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:41,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:41,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:26:41,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:26:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:41,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:26:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802702508] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:26:42,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:26:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 12] total 30 [2025-01-09 04:26:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664213176] [2025-01-09 04:26:42,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:26:42,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:26:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:42,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:26:42,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:26:42,693 INFO L87 Difference]: Start difference. First operand 60612 states and 75670 transitions. Second operand has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:46,952 INFO L93 Difference]: Finished difference Result 179886 states and 223686 transitions. [2025-01-09 04:26:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 04:26:46,953 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 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 104 [2025-01-09 04:26:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:47,091 INFO L225 Difference]: With dead ends: 179886 [2025-01-09 04:26:47,092 INFO L226 Difference]: Without dead ends: 124022 [2025-01-09 04:26:47,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=748, Invalid=3284, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 04:26:47,121 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1842 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:47,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 1256 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:26:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124022 states. [2025-01-09 04:26:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124022 to 104520. [2025-01-09 04:26:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104520 states, 104519 states have (on average 1.2416689788459514) internal successors, (129778), 104519 states have internal predecessors, (129778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104520 states to 104520 states and 129778 transitions. [2025-01-09 04:26:49,787 INFO L78 Accepts]: Start accepts. Automaton has 104520 states and 129778 transitions. Word has length 104 [2025-01-09 04:26:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:26:49,788 INFO L471 AbstractCegarLoop]: Abstraction has 104520 states and 129778 transitions. [2025-01-09 04:26:49,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 104520 states and 129778 transitions. [2025-01-09 04:26:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:26:49,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:26:49,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:26:49,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:26:49,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 04:26:49,991 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:26:49,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:26:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1483412676, now seen corresponding path program 1 times [2025-01-09 04:26:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:26:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838126701] [2025-01-09 04:26:49,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:26:50,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:26:50,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:26:50,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:26:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838126701] [2025-01-09 04:26:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838126701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:26:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135316491] [2025-01-09 04:26:50,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:26:50,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:26:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:26:50,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:26:50,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:26:50,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:26:50,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:26:50,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:26:50,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:26:50,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:26:50,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:26:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:50,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:26:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:26:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135316491] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:26:51,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:26:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 04:26:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650010407] [2025-01-09 04:26:51,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:26:51,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:26:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:26:51,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:26:51,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:26:51,226 INFO L87 Difference]: Start difference. First operand 104520 states and 129778 transitions. Second operand has 21 states, 21 states have (on average 10.904761904761905) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:26:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:26:55,180 INFO L93 Difference]: Finished difference Result 277144 states and 345397 transitions. [2025-01-09 04:26:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:26:55,181 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.904761904761905) internal successors, (229), 20 states have internal predecessors, (229), 0 states have call successors, (0), 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 104 [2025-01-09 04:26:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:26:55,402 INFO L225 Difference]: With dead ends: 277144 [2025-01-09 04:26:55,403 INFO L226 Difference]: Without dead ends: 183676 [2025-01-09 04:26:55,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:26:55,502 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1287 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:26:55,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 583 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:26:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183676 states.