./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu.cil.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 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:06:22,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:06:22,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:06:22,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:06:22,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:06:22,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:06:22,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:06:22,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:06:22,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:06:22,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:06:22,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:06:22,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:06:22,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:06:22,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:06:22,322 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:06:22,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:06:22,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:06:22,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:06:22,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:06:22,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:06:22,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:06:22,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:06:22,325 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 -> 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb [2025-02-05 16:06:22,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:06:22,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:06:22,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:06:22,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:06:22,600 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:06:22,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu.cil.c [2025-02-05 16:06:23,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a527ff50a/efa773c4aa4d4a088ba0b2a5af38a1ec/FLAGfa6025a23 [2025-02-05 16:06:24,026 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:06:24,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/kundu.cil.c [2025-02-05 16:06:24,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a527ff50a/efa773c4aa4d4a088ba0b2a5af38a1ec/FLAGfa6025a23 [2025-02-05 16:06:24,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a527ff50a/efa773c4aa4d4a088ba0b2a5af38a1ec [2025-02-05 16:06:24,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:06:24,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:06:24,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:06:24,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:06:24,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:06:24,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24, skipping insertion in model container [2025-02-05 16:06:24,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:06:24,492 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/systemc/kundu.cil.c[635,648] [2025-02-05 16:06:24,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:06:24,537 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:06:24,545 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/systemc/kundu.cil.c[635,648] [2025-02-05 16:06:24,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:06:24,576 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:06:24,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24 WrapperNode [2025-02-05 16:06:24,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:06:24,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:06:24,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:06:24,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:06:24,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,606 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 302 [2025-02-05 16:06:24,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:06:24,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:06:24,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:06:24,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:06:24,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,637 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:06:24,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:06:24,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:06:24,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:06:24,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:06:24,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (1/1) ... [2025-02-05 16:06:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:06:24,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:24,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:06:24,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:06:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:06:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2025-02-05 16:06:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2025-02-05 16:06:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:06:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:06:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:06:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:06:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:06:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:06:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:06:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:06:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:06:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:06:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:06:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:06:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:06:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:06:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:06:24,763 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:06:24,765 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:06:25,058 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-05 16:06:25,058 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:06:25,068 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:06:25,069 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:06:25,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:25 BoogieIcfgContainer [2025-02-05 16:06:25,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:06:25,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:06:25,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:06:25,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:06:25,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:06:24" (1/3) ... [2025-02-05 16:06:25,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba8bea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:06:25, skipping insertion in model container [2025-02-05 16:06:25,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:24" (2/3) ... [2025-02-05 16:06:25,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba8bea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:06:25, skipping insertion in model container [2025-02-05 16:06:25,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:25" (3/3) ... [2025-02-05 16:06:25,077 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu.cil.c [2025-02-05 16:06:25,090 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:06:25,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu.cil.c that has 8 procedures, 141 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-05 16:06:25,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:06:25,147 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;@1d14626d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:06:25,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:06:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 119 states have internal predecessors, (165), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 16:06:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:06:25,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:25,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:25,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:25,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash 463256824, now seen corresponding path program 1 times [2025-02-05 16:06:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-02-05 16:06:25,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:25,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:06:25,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:06:25,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-02-05 16:06:25,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050576505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:25,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:25,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606340896] [2025-02-05 16:06:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:25,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:25,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:25,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:25,441 INFO L87 Difference]: Start difference. First operand has 142 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 119 states have internal predecessors, (165), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:25,618 INFO L93 Difference]: Finished difference Result 393 states and 568 transitions. [2025-02-05 16:06:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:06:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-05 16:06:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:25,627 INFO L225 Difference]: With dead ends: 393 [2025-02-05 16:06:25,628 INFO L226 Difference]: Without dead ends: 252 [2025-02-05 16:06:25,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:25,636 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 326 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:25,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 640 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-05 16:06:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2025-02-05 16:06:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 204 states have (on average 1.4019607843137254) internal successors, (286), 208 states have internal predecessors, (286), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 16:06:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 341 transitions. [2025-02-05 16:06:25,684 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 341 transitions. Word has length 60 [2025-02-05 16:06:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:25,684 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 341 transitions. [2025-02-05 16:06:25,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2025-02-05 16:06:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:06:25,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:25,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:25,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:06:25,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:25,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 335956181, now seen corresponding path program 1 times [2025-02-05 16:06:25,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:25,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397224776] [2025-02-05 16:06:25,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:25,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:06:25,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:06:25,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:25,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397224776] [2025-02-05 16:06:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397224776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:25,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917822864] [2025-02-05 16:06:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:25,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:25,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:25,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:25,787 INFO L87 Difference]: Start difference. First operand 246 states and 341 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:25,823 INFO L93 Difference]: Finished difference Result 484 states and 676 transitions. [2025-02-05 16:06:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-05 16:06:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:25,827 INFO L225 Difference]: With dead ends: 484 [2025-02-05 16:06:25,827 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 16:06:25,828 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-02-05 16:06:25,828 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:25,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 16:06:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-02-05 16:06:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 207 states have (on average 1.391304347826087) internal successors, (288), 211 states have internal predecessors, (288), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 16:06:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 343 transitions. [2025-02-05 16:06:25,847 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 343 transitions. Word has length 60 [2025-02-05 16:06:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:25,847 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 343 transitions. [2025-02-05 16:06:25,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 343 transitions. [2025-02-05 16:06:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:06:25,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:25,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:25,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:06:25,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:25,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1797536180, now seen corresponding path program 1 times [2025-02-05 16:06:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:25,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89304953] [2025-02-05 16:06:25,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:25,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:06:25,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:06:25,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89304953] [2025-02-05 16:06:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89304953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73064787] [2025-02-05 16:06:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:25,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:25,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:25,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:25,943 INFO L87 Difference]: Start difference. First operand 249 states and 343 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:26,223 INFO L93 Difference]: Finished difference Result 835 states and 1147 transitions. [2025-02-05 16:06:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-05 16:06:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:26,226 INFO L225 Difference]: With dead ends: 835 [2025-02-05 16:06:26,226 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 16:06:26,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:26,228 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 582 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:26,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1039 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 16:06:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 559. [2025-02-05 16:06:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 474 states have (on average 1.3924050632911393) internal successors, (660), 479 states have internal predecessors, (660), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (56), 52 states have call predecessors, (56), 53 states have call successors, (56) [2025-02-05 16:06:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 772 transitions. [2025-02-05 16:06:26,268 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 772 transitions. Word has length 60 [2025-02-05 16:06:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:26,268 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 772 transitions. [2025-02-05 16:06:26,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 772 transitions. [2025-02-05 16:06:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:06:26,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:26,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:26,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:06:26,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:26,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1524158639, now seen corresponding path program 1 times [2025-02-05 16:06:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813077631] [2025-02-05 16:06:26,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:06:26,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:06:26,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:26,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813077631] [2025-02-05 16:06:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813077631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:26,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006579116] [2025-02-05 16:06:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:26,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:26,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:26,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:26,360 INFO L87 Difference]: Start difference. First operand 559 states and 772 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:26,398 INFO L93 Difference]: Finished difference Result 1116 states and 1555 transitions. [2025-02-05 16:06:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:26,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-05 16:06:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:26,404 INFO L225 Difference]: With dead ends: 1116 [2025-02-05 16:06:26,404 INFO L226 Difference]: Without dead ends: 568 [2025-02-05 16:06:26,405 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-02-05 16:06:26,406 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:26,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-05 16:06:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-02-05 16:06:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 483 states have (on average 1.380952380952381) internal successors, (667), 488 states have internal predecessors, (667), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (56), 52 states have call predecessors, (56), 53 states have call successors, (56) [2025-02-05 16:06:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 779 transitions. [2025-02-05 16:06:26,436 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 779 transitions. Word has length 60 [2025-02-05 16:06:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:26,436 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 779 transitions. [2025-02-05 16:06:26,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 779 transitions. [2025-02-05 16:06:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:06:26,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:26,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:26,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:06:26,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:26,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash -498666640, now seen corresponding path program 1 times [2025-02-05 16:06:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:26,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145353459] [2025-02-05 16:06:26,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:26,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:26,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:06:26,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:06:26,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:26,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:26,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145353459] [2025-02-05 16:06:26,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145353459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:26,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:26,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:26,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155636600] [2025-02-05 16:06:26,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:26,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:26,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:26,498 INFO L87 Difference]: Start difference. First operand 568 states and 779 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:26,788 INFO L93 Difference]: Finished difference Result 2283 states and 3145 transitions. [2025-02-05 16:06:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:06:26,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-05 16:06:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:26,802 INFO L225 Difference]: With dead ends: 2283 [2025-02-05 16:06:26,802 INFO L226 Difference]: Without dead ends: 1664 [2025-02-05 16:06:26,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:26,806 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 674 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:26,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 934 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-02-05 16:06:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1203. [2025-02-05 16:06:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1027 states have (on average 1.379746835443038) internal successors, (1417), 1033 states have internal predecessors, (1417), 112 states have call successors, (112), 60 states have call predecessors, (112), 63 states have return successors, (121), 110 states have call predecessors, (121), 109 states have call successors, (121) [2025-02-05 16:06:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1650 transitions. [2025-02-05 16:06:26,875 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1650 transitions. Word has length 60 [2025-02-05 16:06:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:26,876 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1650 transitions. [2025-02-05 16:06:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1650 transitions. [2025-02-05 16:06:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:26,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:26,878 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] [2025-02-05 16:06:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:06:26,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1710113071, now seen corresponding path program 1 times [2025-02-05 16:06:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218774696] [2025-02-05 16:06:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:26,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:26,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:26,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:26,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218774696] [2025-02-05 16:06:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218774696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:26,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394140] [2025-02-05 16:06:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:26,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:26,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:26,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:26,929 INFO L87 Difference]: Start difference. First operand 1203 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:27,113 INFO L93 Difference]: Finished difference Result 3239 states and 4474 transitions. [2025-02-05 16:06:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:06:27,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-02-05 16:06:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:27,123 INFO L225 Difference]: With dead ends: 3239 [2025-02-05 16:06:27,124 INFO L226 Difference]: Without dead ends: 2047 [2025-02-05 16:06:27,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:27,128 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 294 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:27,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 805 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-02-05 16:06:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1641. [2025-02-05 16:06:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1385 states have (on average 1.339350180505415) internal successors, (1855), 1396 states have internal predecessors, (1855), 165 states have call successors, (165), 88 states have call predecessors, (165), 90 states have return successors, (186), 157 states have call predecessors, (186), 162 states have call successors, (186) [2025-02-05 16:06:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2206 transitions. [2025-02-05 16:06:27,208 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2206 transitions. Word has length 61 [2025-02-05 16:06:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:27,208 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2206 transitions. [2025-02-05 16:06:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2206 transitions. [2025-02-05 16:06:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:27,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:27,209 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] [2025-02-05 16:06:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:06:27,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash -126849490, now seen corresponding path program 1 times [2025-02-05 16:06:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-02-05 16:06:27,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:27,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:27,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:27,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:27,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:27,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-02-05 16:06:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323020215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:27,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:27,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319829311] [2025-02-05 16:06:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:27,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:27,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:27,283 INFO L87 Difference]: Start difference. First operand 1641 states and 2206 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:27,372 INFO L93 Difference]: Finished difference Result 3301 states and 4499 transitions. [2025-02-05 16:06:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-02-05 16:06:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:27,382 INFO L225 Difference]: With dead ends: 3301 [2025-02-05 16:06:27,383 INFO L226 Difference]: Without dead ends: 1671 [2025-02-05 16:06:27,387 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-02-05 16:06:27,388 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:27,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 729 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-02-05 16:06:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2025-02-05 16:06:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1415 states have (on average 1.3279151943462897) internal successors, (1879), 1426 states have internal predecessors, (1879), 165 states have call successors, (165), 88 states have call predecessors, (165), 90 states have return successors, (186), 157 states have call predecessors, (186), 162 states have call successors, (186) [2025-02-05 16:06:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2230 transitions. [2025-02-05 16:06:27,476 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2230 transitions. Word has length 61 [2025-02-05 16:06:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2230 transitions. [2025-02-05 16:06:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2230 transitions. [2025-02-05 16:06:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:27,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:27,477 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] [2025-02-05 16:06:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:06:27,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -381586035, now seen corresponding path program 1 times [2025-02-05 16:06:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273822442] [2025-02-05 16:06:27,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:27,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:27,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:27,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:27,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273822442] [2025-02-05 16:06:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273822442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:27,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346586067] [2025-02-05 16:06:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:27,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:27,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:27,531 INFO L87 Difference]: Start difference. First operand 1671 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:06:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:27,702 INFO L93 Difference]: Finished difference Result 4379 states and 5805 transitions. [2025-02-05 16:06:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2025-02-05 16:06:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:27,717 INFO L225 Difference]: With dead ends: 4379 [2025-02-05 16:06:27,717 INFO L226 Difference]: Without dead ends: 3008 [2025-02-05 16:06:27,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:27,723 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 140 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:27,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 735 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-02-05 16:06:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2952. [2025-02-05 16:06:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2511 states have (on average 1.3166069295101552) internal successors, (3306), 2540 states have internal predecessors, (3306), 277 states have call successors, (277), 158 states have call predecessors, (277), 163 states have return successors, (312), 254 states have call predecessors, (312), 274 states have call successors, (312) [2025-02-05 16:06:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3895 transitions. [2025-02-05 16:06:27,860 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3895 transitions. Word has length 61 [2025-02-05 16:06:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:27,861 INFO L471 AbstractCegarLoop]: Abstraction has 2952 states and 3895 transitions. [2025-02-05 16:06:27,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 16:06:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3895 transitions. [2025-02-05 16:06:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:06:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:27,862 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:06:27,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:06:27,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2027453141, now seen corresponding path program 1 times [2025-02-05 16:06:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478424528] [2025-02-05 16:06:27,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:27,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:06:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:06:27,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:27,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478424528] [2025-02-05 16:06:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478424528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:06:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013640467] [2025-02-05 16:06:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:06:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:27,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:06:27,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:06:27,960 INFO L87 Difference]: Start difference. First operand 2952 states and 3895 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:06:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:28,208 INFO L93 Difference]: Finished difference Result 6677 states and 8822 transitions. [2025-02-05 16:06:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:06:28,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-02-05 16:06:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:28,225 INFO L225 Difference]: With dead ends: 6677 [2025-02-05 16:06:28,225 INFO L226 Difference]: Without dead ends: 4456 [2025-02-05 16:06:28,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:06:28,233 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 297 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:28,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1369 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2025-02-05 16:06:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 4431. [2025-02-05 16:06:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 3789 states have (on average 1.3077329110583267) internal successors, (4955), 3826 states have internal predecessors, (4955), 401 states have call successors, (401), 231 states have call predecessors, (401), 240 states have return successors, (451), 374 states have call predecessors, (451), 398 states have call successors, (451) [2025-02-05 16:06:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 5807 transitions. [2025-02-05 16:06:28,372 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 5807 transitions. Word has length 73 [2025-02-05 16:06:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 5807 transitions. [2025-02-05 16:06:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 16:06:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 5807 transitions. [2025-02-05 16:06:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:06:28,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:28,375 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] [2025-02-05 16:06:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:06:28,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -763980393, now seen corresponding path program 1 times [2025-02-05 16:06:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278671387] [2025-02-05 16:06:28,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:28,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:06:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:06:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:06:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278671387] [2025-02-05 16:06:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278671387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96283529] [2025-02-05 16:06:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:28,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:28,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:28,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:28,430 INFO L87 Difference]: Start difference. First operand 4431 states and 5807 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:28,759 INFO L93 Difference]: Finished difference Result 13515 states and 17880 transitions. [2025-02-05 16:06:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 78 [2025-02-05 16:06:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:28,797 INFO L225 Difference]: With dead ends: 13515 [2025-02-05 16:06:28,797 INFO L226 Difference]: Without dead ends: 9096 [2025-02-05 16:06:28,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:28,811 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 214 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:28,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9096 states. [2025-02-05 16:06:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9096 to 9091. [2025-02-05 16:06:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9091 states, 7814 states have (on average 1.2832096237522397) internal successors, (10027), 7894 states have internal predecessors, (10027), 766 states have call successors, (766), 461 states have call predecessors, (766), 510 states have return successors, (1084), 737 states have call predecessors, (1084), 763 states have call successors, (1084) [2025-02-05 16:06:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 11877 transitions. [2025-02-05 16:06:29,187 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 11877 transitions. Word has length 78 [2025-02-05 16:06:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:29,188 INFO L471 AbstractCegarLoop]: Abstraction has 9091 states and 11877 transitions. [2025-02-05 16:06:29,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 11877 transitions. [2025-02-05 16:06:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:06:29,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:29,191 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] [2025-02-05 16:06:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:06:29,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash -477993973, now seen corresponding path program 1 times [2025-02-05 16:06:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365574852] [2025-02-05 16:06:29,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:29,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:06:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:06:29,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:29,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:06:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365574852] [2025-02-05 16:06:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365574852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707587940] [2025-02-05 16:06:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:29,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:29,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:29,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:29,250 INFO L87 Difference]: Start difference. First operand 9091 states and 11877 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:29,773 INFO L93 Difference]: Finished difference Result 26606 states and 34899 transitions. [2025-02-05 16:06:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 80 [2025-02-05 16:06:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:29,847 INFO L225 Difference]: With dead ends: 26606 [2025-02-05 16:06:29,847 INFO L226 Difference]: Without dead ends: 17533 [2025-02-05 16:06:29,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:29,874 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 201 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:29,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 534 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17533 states. [2025-02-05 16:06:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17533 to 17300. [2025-02-05 16:06:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17300 states, 14911 states have (on average 1.2627590369525854) internal successors, (18829), 15081 states have internal predecessors, (18829), 1382 states have call successors, (1382), 841 states have call predecessors, (1382), 1006 states have return successors, (2340), 1381 states have call predecessors, (2340), 1379 states have call successors, (2340) [2025-02-05 16:06:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17300 states to 17300 states and 22551 transitions. [2025-02-05 16:06:30,519 INFO L78 Accepts]: Start accepts. Automaton has 17300 states and 22551 transitions. Word has length 80 [2025-02-05 16:06:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:30,520 INFO L471 AbstractCegarLoop]: Abstraction has 17300 states and 22551 transitions. [2025-02-05 16:06:30,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17300 states and 22551 transitions. [2025-02-05 16:06:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:06:30,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:30,525 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] [2025-02-05 16:06:30,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:06:30,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:30,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1707940074, now seen corresponding path program 1 times [2025-02-05 16:06:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:30,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564433772] [2025-02-05 16:06:30,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:30,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:06:30,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:06:30,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:06:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:30,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564433772] [2025-02-05 16:06:30,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564433772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:30,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:30,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:30,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358338986] [2025-02-05 16:06:30,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:30,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:30,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:30,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:30,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:30,553 INFO L87 Difference]: Start difference. First operand 17300 states and 22551 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:31,096 INFO L93 Difference]: Finished difference Result 34572 states and 45054 transitions. [2025-02-05 16:06:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:31,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 16:06:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:31,153 INFO L225 Difference]: With dead ends: 34572 [2025-02-05 16:06:31,153 INFO L226 Difference]: Without dead ends: 17290 [2025-02-05 16:06:31,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:31,190 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:31,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 185 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2025-02-05 16:06:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17290. [2025-02-05 16:06:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17290 states, 14907 states have (on average 1.2625612128530221) internal successors, (18821), 15075 states have internal predecessors, (18821), 1376 states have call successors, (1376), 841 states have call predecessors, (1376), 1006 states have return successors, (2334), 1375 states have call predecessors, (2334), 1373 states have call successors, (2334) [2025-02-05 16:06:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17290 states to 17290 states and 22531 transitions. [2025-02-05 16:06:31,717 INFO L78 Accepts]: Start accepts. Automaton has 17290 states and 22531 transitions. Word has length 80 [2025-02-05 16:06:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:31,717 INFO L471 AbstractCegarLoop]: Abstraction has 17290 states and 22531 transitions. [2025-02-05 16:06:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:06:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17290 states and 22531 transitions. [2025-02-05 16:06:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:06:31,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:31,720 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] [2025-02-05 16:06:31,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:06:31,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1922929989, now seen corresponding path program 1 times [2025-02-05 16:06:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14482115] [2025-02-05 16:06:31,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:31,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:06:31,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:06:31,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:31,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:06:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14482115] [2025-02-05 16:06:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14482115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503500661] [2025-02-05 16:06:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:31,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:31,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:31,770 INFO L87 Difference]: Start difference. First operand 17290 states and 22531 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:32,566 INFO L93 Difference]: Finished difference Result 43372 states and 57200 transitions. [2025-02-05 16:06:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:06:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2025-02-05 16:06:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:32,656 INFO L225 Difference]: With dead ends: 43372 [2025-02-05 16:06:32,656 INFO L226 Difference]: Without dead ends: 26100 [2025-02-05 16:06:32,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:32,687 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 859 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:32,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 832 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26100 states. [2025-02-05 16:06:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26100 to 25943. [2025-02-05 16:06:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25943 states, 22241 states have (on average 1.2451328627309923) internal successors, (27693), 22501 states have internal predecessors, (27693), 2133 states have call successors, (2133), 1310 states have call predecessors, (2133), 1568 states have return successors, (3778), 2135 states have call predecessors, (3778), 2130 states have call successors, (3778) [2025-02-05 16:06:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25943 states to 25943 states and 33604 transitions. [2025-02-05 16:06:33,879 INFO L78 Accepts]: Start accepts. Automaton has 25943 states and 33604 transitions. Word has length 82 [2025-02-05 16:06:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 25943 states and 33604 transitions. [2025-02-05 16:06:33,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 16:06:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25943 states and 33604 transitions. [2025-02-05 16:06:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:06:33,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:33,886 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:33,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:06:33,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:33,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2126121326, now seen corresponding path program 1 times [2025-02-05 16:06:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681412507] [2025-02-05 16:06:33,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:33,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:06:33,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:06:33,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:33,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:06:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681412507] [2025-02-05 16:06:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681412507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415480386] [2025-02-05 16:06:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:33,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:33,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:33,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:33,934 INFO L87 Difference]: Start difference. First operand 25943 states and 33604 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:34,669 INFO L93 Difference]: Finished difference Result 49812 states and 64309 transitions. [2025-02-05 16:06:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2025-02-05 16:06:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:34,757 INFO L225 Difference]: With dead ends: 49812 [2025-02-05 16:06:34,757 INFO L226 Difference]: Without dead ends: 26290 [2025-02-05 16:06:34,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:34,801 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 176 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:34,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 397 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26290 states. [2025-02-05 16:06:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26290 to 25822. [2025-02-05 16:06:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25822 states, 22016 states have (on average 1.2365552325581395) internal successors, (27224), 22466 states have internal predecessors, (27224), 2091 states have call successors, (2091), 1284 states have call predecessors, (2091), 1714 states have return successors, (3628), 2075 states have call predecessors, (3628), 2088 states have call successors, (3628) [2025-02-05 16:06:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25822 states to 25822 states and 32943 transitions. [2025-02-05 16:06:35,580 INFO L78 Accepts]: Start accepts. Automaton has 25822 states and 32943 transitions. Word has length 99 [2025-02-05 16:06:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:35,581 INFO L471 AbstractCegarLoop]: Abstraction has 25822 states and 32943 transitions. [2025-02-05 16:06:35,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25822 states and 32943 transitions. [2025-02-05 16:06:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:06:35,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:35,587 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:35,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:06:35,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:35,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1230314355, now seen corresponding path program 1 times [2025-02-05 16:06:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489204510] [2025-02-05 16:06:35,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:35,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:06:35,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:06:35,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:35,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 16:06:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489204510] [2025-02-05 16:06:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489204510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209077427] [2025-02-05 16:06:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:35,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:35,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:35,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:35,611 INFO L87 Difference]: Start difference. First operand 25822 states and 32943 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:06:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:36,134 INFO L93 Difference]: Finished difference Result 28148 states and 35818 transitions. [2025-02-05 16:06:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2025-02-05 16:06:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:36,216 INFO L225 Difference]: With dead ends: 28148 [2025-02-05 16:06:36,216 INFO L226 Difference]: Without dead ends: 25814 [2025-02-05 16:06:36,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:36,232 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:36,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 184 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25814 states. [2025-02-05 16:06:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25814 to 25509. [2025-02-05 16:06:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25509 states, 21761 states have (on average 1.2369835945039291) internal successors, (26918), 22209 states have internal predecessors, (26918), 2053 states have call successors, (2053), 1264 states have call predecessors, (2053), 1694 states have return successors, (3581), 2037 states have call predecessors, (3581), 2050 states have call successors, (3581) [2025-02-05 16:06:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25509 states to 25509 states and 32552 transitions. [2025-02-05 16:06:37,412 INFO L78 Accepts]: Start accepts. Automaton has 25509 states and 32552 transitions. Word has length 99 [2025-02-05 16:06:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:37,412 INFO L471 AbstractCegarLoop]: Abstraction has 25509 states and 32552 transitions. [2025-02-05 16:06:37,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:06:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 25509 states and 32552 transitions. [2025-02-05 16:06:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:06:37,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:37,420 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:06:37,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:37,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1783864259, now seen corresponding path program 1 times [2025-02-05 16:06:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53226895] [2025-02-05 16:06:37,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:37,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:06:37,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:06:37,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:37,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:06:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53226895] [2025-02-05 16:06:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53226895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:06:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889995968] [2025-02-05 16:06:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:37,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:06:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:06:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:06:37,493 INFO L87 Difference]: Start difference. First operand 25509 states and 32552 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:38,707 INFO L93 Difference]: Finished difference Result 51522 states and 65721 transitions. [2025-02-05 16:06:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:06:38,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 100 [2025-02-05 16:06:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:38,798 INFO L225 Difference]: With dead ends: 51522 [2025-02-05 16:06:38,798 INFO L226 Difference]: Without dead ends: 26031 [2025-02-05 16:06:38,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:06:38,843 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1270 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:38,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1177 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26031 states. [2025-02-05 16:06:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26031 to 25509. [2025-02-05 16:06:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25509 states, 21761 states have (on average 1.2252194292541703) internal successors, (26662), 22209 states have internal predecessors, (26662), 2053 states have call successors, (2053), 1264 states have call predecessors, (2053), 1694 states have return successors, (3217), 2037 states have call predecessors, (3217), 2050 states have call successors, (3217) [2025-02-05 16:06:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25509 states to 25509 states and 31932 transitions. [2025-02-05 16:06:39,685 INFO L78 Accepts]: Start accepts. Automaton has 25509 states and 31932 transitions. Word has length 100 [2025-02-05 16:06:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:39,685 INFO L471 AbstractCegarLoop]: Abstraction has 25509 states and 31932 transitions. [2025-02-05 16:06:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25509 states and 31932 transitions. [2025-02-05 16:06:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:06:39,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:39,691 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:39,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:06:39,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:39,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:39,693 INFO L85 PathProgramCache]: Analyzing trace with hash -193321716, now seen corresponding path program 1 times [2025-02-05 16:06:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564804014] [2025-02-05 16:06:39,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:06:39,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:06:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:06:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:39,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564804014] [2025-02-05 16:06:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564804014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:39,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:39,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:06:39,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289706593] [2025-02-05 16:06:39,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:39,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:39,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:39,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:06:39,764 INFO L87 Difference]: Start difference. First operand 25509 states and 31932 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:40,625 INFO L93 Difference]: Finished difference Result 51520 states and 64405 transitions. [2025-02-05 16:06:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:06:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 101 [2025-02-05 16:06:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:40,703 INFO L225 Difference]: With dead ends: 51520 [2025-02-05 16:06:40,703 INFO L226 Difference]: Without dead ends: 23289 [2025-02-05 16:06:40,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:40,757 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 667 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:40,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 916 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23289 states. [2025-02-05 16:06:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23289 to 22835. [2025-02-05 16:06:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22835 states, 19408 states have (on average 1.2158388293487221) internal successors, (23597), 19827 states have internal predecessors, (23597), 1908 states have call successors, (1908), 1170 states have call predecessors, (1908), 1518 states have return successors, (2715), 1839 states have call predecessors, (2715), 1904 states have call successors, (2715) [2025-02-05 16:06:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22835 states to 22835 states and 28220 transitions. [2025-02-05 16:06:41,447 INFO L78 Accepts]: Start accepts. Automaton has 22835 states and 28220 transitions. Word has length 101 [2025-02-05 16:06:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:41,448 INFO L471 AbstractCegarLoop]: Abstraction has 22835 states and 28220 transitions. [2025-02-05 16:06:41,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22835 states and 28220 transitions. [2025-02-05 16:06:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:06:41,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:41,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 16:06:41,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:06:41,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:41,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash 40490066, now seen corresponding path program 1 times [2025-02-05 16:06:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:41,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111736874] [2025-02-05 16:06:41,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:41,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:41,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:06:41,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:06:41,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:41,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 16:06:41,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:41,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111736874] [2025-02-05 16:06:41,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111736874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:06:41,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987031391] [2025-02-05 16:06:41,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:41,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:06:41,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:41,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:06:41,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:06:41,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:06:41,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:06:41,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:41,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:41,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 16:06:41,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:06:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:06:41,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:06:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 16:06:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987031391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:06:41,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:06:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2025-02-05 16:06:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234373929] [2025-02-05 16:06:41,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:06:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:06:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:41,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:06:41,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:06:41,981 INFO L87 Difference]: Start difference. First operand 22835 states and 28220 transitions. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 5 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-05 16:06:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:42,941 INFO L93 Difference]: Finished difference Result 54003 states and 66873 transitions. [2025-02-05 16:06:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:06:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 5 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 119 [2025-02-05 16:06:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:43,084 INFO L225 Difference]: With dead ends: 54003 [2025-02-05 16:06:43,085 INFO L226 Difference]: Without dead ends: 32824 [2025-02-05 16:06:43,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:06:43,142 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 768 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:43,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1224 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32824 states. [2025-02-05 16:06:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32824 to 27756. [2025-02-05 16:06:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27756 states, 23651 states have (on average 1.2155088579764068) internal successors, (28748), 24158 states have internal predecessors, (28748), 2268 states have call successors, (2268), 1396 states have call predecessors, (2268), 1836 states have return successors, (3260), 2203 states have call predecessors, (3260), 2264 states have call successors, (3260) [2025-02-05 16:06:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27756 states to 27756 states and 34276 transitions. [2025-02-05 16:06:44,220 INFO L78 Accepts]: Start accepts. Automaton has 27756 states and 34276 transitions. Word has length 119 [2025-02-05 16:06:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 27756 states and 34276 transitions. [2025-02-05 16:06:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 5 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-05 16:06:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 27756 states and 34276 transitions. [2025-02-05 16:06:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:06:44,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:44,227 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:44,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:06:44,428 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,SelfDestructingSolverStorable17 [2025-02-05 16:06:44,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1522438652, now seen corresponding path program 1 times [2025-02-05 16:06:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339063004] [2025-02-05 16:06:44,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:44,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:06:44,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:06:44,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:44,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 16:06:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339063004] [2025-02-05 16:06:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339063004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382812019] [2025-02-05 16:06:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:44,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:44,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:44,465 INFO L87 Difference]: Start difference. First operand 27756 states and 34276 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 16:06:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:45,902 INFO L93 Difference]: Finished difference Result 53467 states and 66202 transitions. [2025-02-05 16:06:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 123 [2025-02-05 16:06:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:46,002 INFO L225 Difference]: With dead ends: 53467 [2025-02-05 16:06:46,002 INFO L226 Difference]: Without dead ends: 35182 [2025-02-05 16:06:46,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:46,044 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 150 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:46,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 384 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2025-02-05 16:06:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 32626. [2025-02-05 16:06:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32626 states, 27819 states have (on average 1.218304036809375) internal successors, (33892), 28416 states have internal predecessors, (33892), 2638 states have call successors, (2638), 1650 states have call predecessors, (2638), 2168 states have return successors, (3740), 2561 states have call predecessors, (3740), 2634 states have call successors, (3740) [2025-02-05 16:06:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32626 states to 32626 states and 40270 transitions. [2025-02-05 16:06:47,334 INFO L78 Accepts]: Start accepts. Automaton has 32626 states and 40270 transitions. Word has length 123 [2025-02-05 16:06:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:47,335 INFO L471 AbstractCegarLoop]: Abstraction has 32626 states and 40270 transitions. [2025-02-05 16:06:47,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 16:06:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 32626 states and 40270 transitions. [2025-02-05 16:06:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:06:47,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:47,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:06:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:06:47,340 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:47,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -295331571, now seen corresponding path program 1 times [2025-02-05 16:06:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251416985] [2025-02-05 16:06:47,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:47,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:06:47,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:06:47,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:47,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:06:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251416985] [2025-02-05 16:06:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251416985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:47,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184642906] [2025-02-05 16:06:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:47,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:47,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:47,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:47,388 INFO L87 Difference]: Start difference. First operand 32626 states and 40270 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:06:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:48,884 INFO L93 Difference]: Finished difference Result 83606 states and 103702 transitions. [2025-02-05 16:06:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:06:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 127 [2025-02-05 16:06:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:49,033 INFO L225 Difference]: With dead ends: 83606 [2025-02-05 16:06:49,033 INFO L226 Difference]: Without dead ends: 50998 [2025-02-05 16:06:49,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:49,102 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 284 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:49,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 621 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50998 states. [2025-02-05 16:06:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50998 to 50759. [2025-02-05 16:06:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50759 states, 43058 states have (on average 1.2098332481768777) internal successors, (52093), 43883 states have internal predecessors, (52093), 4288 states have call successors, (4288), 2701 states have call predecessors, (4288), 3412 states have return successors, (5802), 4176 states have call predecessors, (5802), 4284 states have call successors, (5802) [2025-02-05 16:06:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50759 states to 50759 states and 62183 transitions. [2025-02-05 16:06:51,082 INFO L78 Accepts]: Start accepts. Automaton has 50759 states and 62183 transitions. Word has length 127 [2025-02-05 16:06:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 50759 states and 62183 transitions. [2025-02-05 16:06:51,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:06:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50759 states and 62183 transitions. [2025-02-05 16:06:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:06:51,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:51,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:06:51,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:06:51,089 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1528181419, now seen corresponding path program 1 times [2025-02-05 16:06:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:51,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056379507] [2025-02-05 16:06:51,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:51,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:06:51,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:06:51,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:51,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:06:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056379507] [2025-02-05 16:06:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056379507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:06:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484842652] [2025-02-05 16:06:51,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:51,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:06:51,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:51,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:06:51,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:06:51,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:06:51,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:06:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:51,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:06:51,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:06:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 16:06:51,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:06:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484842652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:51,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:06:51,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-02-05 16:06:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230644672] [2025-02-05 16:06:51,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:51,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:51,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:51,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:51,348 INFO L87 Difference]: Start difference. First operand 50759 states and 62183 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:06:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:52,607 INFO L93 Difference]: Finished difference Result 92591 states and 113628 transitions. [2025-02-05 16:06:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:52,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 128 [2025-02-05 16:06:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:52,738 INFO L225 Difference]: With dead ends: 92591 [2025-02-05 16:06:52,738 INFO L226 Difference]: Without dead ends: 41844 [2025-02-05 16:06:52,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:52,826 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 87 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:52,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 366 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41844 states. [2025-02-05 16:06:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41844 to 41611. [2025-02-05 16:06:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41611 states, 35322 states have (on average 1.2031028820565086) internal successors, (42496), 35971 states have internal predecessors, (42496), 3503 states have call successors, (3503), 2210 states have call predecessors, (3503), 2785 states have return successors, (4709), 3431 states have call predecessors, (4709), 3499 states have call successors, (4709) [2025-02-05 16:06:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41611 states to 41611 states and 50708 transitions. [2025-02-05 16:06:55,484 INFO L78 Accepts]: Start accepts. Automaton has 41611 states and 50708 transitions. Word has length 128 [2025-02-05 16:06:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:55,485 INFO L471 AbstractCegarLoop]: Abstraction has 41611 states and 50708 transitions. [2025-02-05 16:06:55,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 16:06:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 41611 states and 50708 transitions. [2025-02-05 16:06:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:06:55,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:55,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 16:06:55,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:06:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:06:55,692 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:55,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash -198574063, now seen corresponding path program 1 times [2025-02-05 16:06:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058207427] [2025-02-05 16:06:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:55,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:06:55,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:06:55,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:55,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 16:06:55,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:55,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058207427] [2025-02-05 16:06:55,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058207427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:06:55,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182749413] [2025-02-05 16:06:55,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:55,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:06:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:55,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:06:55,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:06:55,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:06:55,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:06:55,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:55,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:55,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 16:06:55,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:06:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:06:55,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:06:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182749413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:55,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:06:55,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-05 16:06:55,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196421335] [2025-02-05 16:06:55,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:55,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:06:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:55,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:06:55,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:06:55,990 INFO L87 Difference]: Start difference. First operand 41611 states and 50708 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:57,584 INFO L93 Difference]: Finished difference Result 75939 states and 93060 transitions. [2025-02-05 16:06:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:57,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 128 [2025-02-05 16:06:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:57,737 INFO L225 Difference]: With dead ends: 75939 [2025-02-05 16:06:57,737 INFO L226 Difference]: Without dead ends: 47195 [2025-02-05 16:06:57,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:06:57,786 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 377 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:57,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 726 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47195 states. [2025-02-05 16:06:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47195 to 44584. [2025-02-05 16:06:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44584 states, 37858 states have (on average 1.2005916847165725) internal successors, (45452), 38564 states have internal predecessors, (45452), 3739 states have call successors, (3739), 2356 states have call predecessors, (3739), 2986 states have return successors, (5063), 3665 states have call predecessors, (5063), 3735 states have call successors, (5063) [2025-02-05 16:06:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44584 states to 44584 states and 54254 transitions. [2025-02-05 16:06:59,460 INFO L78 Accepts]: Start accepts. Automaton has 44584 states and 54254 transitions. Word has length 128 [2025-02-05 16:06:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:59,460 INFO L471 AbstractCegarLoop]: Abstraction has 44584 states and 54254 transitions. [2025-02-05 16:06:59,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 16:06:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 44584 states and 54254 transitions. [2025-02-05 16:06:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 16:06:59,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:59,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:59,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:06:59,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:06:59,666 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:59,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1794856119, now seen corresponding path program 1 times [2025-02-05 16:06:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782383699] [2025-02-05 16:06:59,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:59,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 16:06:59,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 16:06:59,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:59,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 16:06:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782383699] [2025-02-05 16:06:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782383699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:06:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130363909] [2025-02-05 16:06:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:06:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:59,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:06:59,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:06:59,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 16:06:59,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 16:06:59,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:59,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:59,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 16:06:59,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:06:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:06:59,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:07:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 16:07:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130363909] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:07:00,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:07:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2025-02-05 16:07:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128196853] [2025-02-05 16:07:00,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:07:00,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:07:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:00,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:07:00,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:07:00,152 INFO L87 Difference]: Start difference. First operand 44584 states and 54254 transitions. Second operand has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 11 states have internal predecessors, (227), 7 states have call successors, (26), 7 states have call predecessors, (26), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2025-02-05 16:07:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:02,110 INFO L93 Difference]: Finished difference Result 64942 states and 79182 transitions. [2025-02-05 16:07:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:07:02,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 11 states have internal predecessors, (227), 7 states have call successors, (26), 7 states have call predecessors, (26), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 139 [2025-02-05 16:07:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:02,255 INFO L225 Difference]: With dead ends: 64942 [2025-02-05 16:07:02,255 INFO L226 Difference]: Without dead ends: 54065 [2025-02-05 16:07:02,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:07:02,293 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 655 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:02,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1973 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2025-02-05 16:07:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 47427. [2025-02-05 16:07:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47427 states, 40190 states have (on average 1.1983329186364768) internal successors, (48161), 40937 states have internal predecessors, (48161), 4050 states have call successors, (4050), 2557 states have call predecessors, (4050), 3186 states have return successors, (5379), 3934 states have call predecessors, (5379), 4047 states have call successors, (5379) [2025-02-05 16:07:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47427 states to 47427 states and 57590 transitions. [2025-02-05 16:07:04,005 INFO L78 Accepts]: Start accepts. Automaton has 47427 states and 57590 transitions. Word has length 139 [2025-02-05 16:07:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:04,005 INFO L471 AbstractCegarLoop]: Abstraction has 47427 states and 57590 transitions. [2025-02-05 16:07:04,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 11 states have internal predecessors, (227), 7 states have call successors, (26), 7 states have call predecessors, (26), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2025-02-05 16:07:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47427 states and 57590 transitions. [2025-02-05 16:07:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:07:04,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:04,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:04,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:07:04,213 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,SelfDestructingSolverStorable22 [2025-02-05 16:07:04,214 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1136509738, now seen corresponding path program 1 times [2025-02-05 16:07:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411106142] [2025-02-05 16:07:04,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:04,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:07:04,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:07:04,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:04,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 16:07:04,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411106142] [2025-02-05 16:07:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411106142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415468085] [2025-02-05 16:07:04,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:04,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:04,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:04,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:07:04,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:07:04,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:07:04,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:04,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:04,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:04,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 16:07:04,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415468085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-02-05 16:07:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269137152] [2025-02-05 16:07:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:04,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:04,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:07:04,443 INFO L87 Difference]: Start difference. First operand 47427 states and 57590 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 16:07:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:05,984 INFO L93 Difference]: Finished difference Result 83666 states and 102428 transitions. [2025-02-05 16:07:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:05,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 145 [2025-02-05 16:07:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:06,116 INFO L225 Difference]: With dead ends: 83666 [2025-02-05 16:07:06,116 INFO L226 Difference]: Without dead ends: 39401 [2025-02-05 16:07:06,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:07:06,177 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 88 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 386 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-02-05 16:07:06,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 386 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2025-02-05 16:07:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 38257. [2025-02-05 16:07:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38257 states, 32360 states have (on average 1.2072620519159456) internal successors, (39067), 32974 states have internal predecessors, (39067), 3307 states have call successors, (3307), 2073 states have call predecessors, (3307), 2589 states have return successors, (4439), 3211 states have call predecessors, (4439), 3304 states have call successors, (4439) [2025-02-05 16:07:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38257 states to 38257 states and 46813 transitions. [2025-02-05 16:07:07,601 INFO L78 Accepts]: Start accepts. Automaton has 38257 states and 46813 transitions. Word has length 145 [2025-02-05 16:07:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:07,601 INFO L471 AbstractCegarLoop]: Abstraction has 38257 states and 46813 transitions. [2025-02-05 16:07:07,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 16:07:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 38257 states and 46813 transitions. [2025-02-05 16:07:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 16:07:07,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:07,612 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:07,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 16:07:07,812 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,SelfDestructingSolverStorable23 [2025-02-05 16:07:07,812 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:07,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 247594710, now seen corresponding path program 1 times [2025-02-05 16:07:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:07,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103333198] [2025-02-05 16:07:07,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:07,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 16:07:07,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 16:07:07,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 28 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 16:07:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103333198] [2025-02-05 16:07:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103333198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808219516] [2025-02-05 16:07:07,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:07,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:07,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:07,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:07:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 16:07:07,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 16:07:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:07,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:07,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 16:07:08,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:08,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808219516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:08,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:08,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 16:07:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052718266] [2025-02-05 16:07:08,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:08,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:08,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:08,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:07:08,070 INFO L87 Difference]: Start difference. First operand 38257 states and 46813 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)