./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:24:28,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:24:28,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:24:28,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:24:28,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:24:28,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:24:28,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:24:28,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:24:28,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:24:28,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:24:28,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:24:28,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:24:28,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:24:28,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:24:28,457 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:24:28,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:24:28,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:24:28,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:24:28,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:24:28,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:24:28,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:24:28,459 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 -> 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 [2025-01-09 04:24:28,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:24:28,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:24:28,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:24:28,654 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:24:28,654 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:24:28,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2025-01-09 04:24:29,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67d1eb358/4f7b57e88597479ea18ec6fce421fd4e/FLAGc08dfc78a [2025-01-09 04:24:29,933 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:24:29,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2025-01-09 04:24:29,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67d1eb358/4f7b57e88597479ea18ec6fce421fd4e/FLAGc08dfc78a [2025-01-09 04:24:30,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67d1eb358/4f7b57e88597479ea18ec6fce421fd4e [2025-01-09 04:24:30,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:24:30,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:24:30,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:24:30,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:24:30,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:24:30,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30, skipping insertion in model container [2025-01-09 04:24:30,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:24:30,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2025-01-09 04:24:30,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:24:30,477 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:24:30,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2025-01-09 04:24:30,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:24:30,535 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:24:30,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30 WrapperNode [2025-01-09 04:24:30,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:24:30,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:24:30,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:24:30,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:24:30,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,568 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 276 [2025-01-09 04:24:30,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:24:30,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:24:30,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:24:30,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:24:30,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,594 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:24:30,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:24:30,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:24:30,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:24:30,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:24:30,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (1/1) ... [2025-01-09 04:24:30,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:24:30,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:30,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:24:30,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:24:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:24:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:24:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:24:30,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:24:30,711 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:24:30,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:24:30,937 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 04:24:30,937 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:24:30,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:24:30,944 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:24:30,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:30 BoogieIcfgContainer [2025-01-09 04:24:30,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:24:30,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:24:30,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:24:30,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:24:30,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:24:30" (1/3) ... [2025-01-09 04:24:30,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c66b35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:30, skipping insertion in model container [2025-01-09 04:24:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:30" (2/3) ... [2025-01-09 04:24:30,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c66b35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:30, skipping insertion in model container [2025-01-09 04:24:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:30" (3/3) ... [2025-01-09 04:24:30,951 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2025-01-09 04:24:30,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:24:30,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:24:30,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:24:31,011 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;@40f0cc26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:24:31,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:24:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 04:24:31,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:31,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:31,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1261664278, now seen corresponding path program 1 times [2025-01-09 04:24:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356978029] [2025-01-09 04:24:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:31,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:24:31,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:24:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:31,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356978029] [2025-01-09 04:24:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356978029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:24:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571607672] [2025-01-09 04:24:31,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:31,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:24:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:31,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:24:31,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:24:31,214 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:31,229 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2025-01-09 04:24:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:24:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 04:24:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:31,237 INFO L225 Difference]: With dead ends: 108 [2025-01-09 04:24:31,237 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 04:24:31,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:24:31,241 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:31,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 04:24:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 04:24:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.703125) internal successors, (109), 64 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2025-01-09 04:24:31,274 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 21 [2025-01-09 04:24:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:31,274 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2025-01-09 04:24:31,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2025-01-09 04:24:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 04:24:31,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:31,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:31,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:24:31,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:31,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2012234664, now seen corresponding path program 1 times [2025-01-09 04:24:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:31,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110565672] [2025-01-09 04:24:31,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:31,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:24:31,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:24:31,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:31,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-01-09 04:24:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110565672] [2025-01-09 04:24:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110565672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:31,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:24:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027785616] [2025-01-09 04:24:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:24:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:31,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:24:31,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:31,501 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:31,573 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2025-01-09 04:24:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:24:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 04:24:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:31,578 INFO L225 Difference]: With dead ends: 141 [2025-01-09 04:24:31,579 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 04:24:31,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:31,580 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:31,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 391 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 04:24:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2025-01-09 04:24:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-01-09 04:24:31,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 21 [2025-01-09 04:24:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-01-09 04:24:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-01-09 04:24:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:24:31,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:31,590 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] [2025-01-09 04:24:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:24:31,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:31,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1661326333, now seen corresponding path program 1 times [2025-01-09 04:24:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613873846] [2025-01-09 04:24:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:31,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:24:31,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:24:31,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:31,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:31,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613873846] [2025-01-09 04:24:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613873846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:24:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010862833] [2025-01-09 04:24:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:31,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:24:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:31,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:24:31,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:24:31,756 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:31,887 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2025-01-09 04:24:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:24:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-01-09 04:24:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:31,890 INFO L225 Difference]: With dead ends: 353 [2025-01-09 04:24:31,890 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 04:24:31,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:24:31,891 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 502 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:31,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 660 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 04:24:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 99. [2025-01-09 04:24:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2025-01-09 04:24:31,899 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 43 [2025-01-09 04:24:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:31,899 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2025-01-09 04:24:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2025-01-09 04:24:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:24:31,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:31,900 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] [2025-01-09 04:24:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:24:31,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:31,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash -222471309, now seen corresponding path program 1 times [2025-01-09 04:24:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735927426] [2025-01-09 04:24:31,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:24:31,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:24:31,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:31,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735927426] [2025-01-09 04:24:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735927426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:31,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:31,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940158113] [2025-01-09 04:24:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:31,966 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:31,981 INFO L93 Difference]: Finished difference Result 228 states and 343 transitions. [2025-01-09 04:24:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-09 04:24:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:31,982 INFO L225 Difference]: With dead ends: 228 [2025-01-09 04:24:31,982 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 04:24:31,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:31,983 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:31,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 04:24:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-01-09 04:24:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 155 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2025-01-09 04:24:31,996 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 45 [2025-01-09 04:24:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:31,996 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2025-01-09 04:24:31,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2025-01-09 04:24:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:24:31,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:31,997 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] [2025-01-09 04:24:31,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:24:31,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:31,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash -155977797, now seen corresponding path program 1 times [2025-01-09 04:24:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:31,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8433465] [2025-01-09 04:24:31,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:24:32,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:24:32,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:32,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8433465] [2025-01-09 04:24:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8433465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:32,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:32,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:24:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407398070] [2025-01-09 04:24:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:32,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:24:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:32,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:24:32,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:24:32,203 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:32,294 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2025-01-09 04:24:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:24:32,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-09 04:24:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:32,295 INFO L225 Difference]: With dead ends: 285 [2025-01-09 04:24:32,295 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 04:24:32,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:32,296 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 168 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:32,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 239 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 04:24:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-01-09 04:24:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2025-01-09 04:24:32,308 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 45 [2025-01-09 04:24:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:32,308 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2025-01-09 04:24:32,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2025-01-09 04:24:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 04:24:32,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:32,311 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] [2025-01-09 04:24:32,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:24:32,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash -955067572, now seen corresponding path program 1 times [2025-01-09 04:24:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:32,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401818052] [2025-01-09 04:24:32,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 04:24:32,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 04:24:32,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401818052] [2025-01-09 04:24:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401818052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:24:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281082272] [2025-01-09 04:24:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:32,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:24:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:24:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:32,451 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:32,472 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-01-09 04:24:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:24:32,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 04:24:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:32,473 INFO L225 Difference]: With dead ends: 164 [2025-01-09 04:24:32,473 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 04:24:32,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:32,474 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:32,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 04:24:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-01-09 04:24:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.434782608695652) internal successors, (231), 161 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2025-01-09 04:24:32,486 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 46 [2025-01-09 04:24:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:32,487 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2025-01-09 04:24:32,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2025-01-09 04:24:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:24:32,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:32,488 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] [2025-01-09 04:24:32,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:24:32,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:32,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1961726021, now seen corresponding path program 1 times [2025-01-09 04:24:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512758814] [2025-01-09 04:24:32,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:24:32,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:24:32,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:32,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512758814] [2025-01-09 04:24:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512758814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:32,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:32,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139864794] [2025-01-09 04:24:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:32,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:32,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:32,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,534 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:32,546 INFO L93 Difference]: Finished difference Result 412 states and 607 transitions. [2025-01-09 04:24:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:24:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:32,551 INFO L225 Difference]: With dead ends: 412 [2025-01-09 04:24:32,552 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 04:24:32,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,552 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:32,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 04:24:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-01-09 04:24:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.4492753623188406) internal successors, (400), 276 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 400 transitions. [2025-01-09 04:24:32,562 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 400 transitions. Word has length 47 [2025-01-09 04:24:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:32,563 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 400 transitions. [2025-01-09 04:24:32,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 400 transitions. [2025-01-09 04:24:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:24:32,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:32,564 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] [2025-01-09 04:24:32,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:24:32,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:32,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 117772475, now seen corresponding path program 1 times [2025-01-09 04:24:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:32,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823887172] [2025-01-09 04:24:32,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:24:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:24:32,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823887172] [2025-01-09 04:24:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823887172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:32,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466018777] [2025-01-09 04:24:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:32,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:32,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:32,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,626 INFO L87 Difference]: Start difference. First operand 277 states and 400 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:32,644 INFO L93 Difference]: Finished difference Result 741 states and 1086 transitions. [2025-01-09 04:24:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:24:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:32,646 INFO L225 Difference]: With dead ends: 741 [2025-01-09 04:24:32,648 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 04:24:32,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,649 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:32,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 04:24:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2025-01-09 04:24:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4408163265306122) internal successors, (706), 490 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 706 transitions. [2025-01-09 04:24:32,667 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 706 transitions. Word has length 47 [2025-01-09 04:24:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:32,669 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 706 transitions. [2025-01-09 04:24:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 706 transitions. [2025-01-09 04:24:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:24:32,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:32,669 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] [2025-01-09 04:24:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:24:32,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:32,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1898705339, now seen corresponding path program 1 times [2025-01-09 04:24:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273243222] [2025-01-09 04:24:32,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:24:32,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:24:32,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273243222] [2025-01-09 04:24:32,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273243222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:32,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:32,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:32,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469956072] [2025-01-09 04:24:32,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:32,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:32,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:32,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,728 INFO L87 Difference]: Start difference. First operand 491 states and 706 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:32,752 INFO L93 Difference]: Finished difference Result 1351 states and 1948 transitions. [2025-01-09 04:24:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:32,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:24:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:32,756 INFO L225 Difference]: With dead ends: 1351 [2025-01-09 04:24:32,756 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 04:24:32,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,758 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:32,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 04:24:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 887. [2025-01-09 04:24:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 1.4153498871331829) internal successors, (1254), 886 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1254 transitions. [2025-01-09 04:24:32,796 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1254 transitions. Word has length 47 [2025-01-09 04:24:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:32,796 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1254 transitions. [2025-01-09 04:24:32,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1254 transitions. [2025-01-09 04:24:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:24:32,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:32,797 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] [2025-01-09 04:24:32,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:24:32,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1094979259, now seen corresponding path program 1 times [2025-01-09 04:24:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882756605] [2025-01-09 04:24:32,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:24:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:24:32,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882756605] [2025-01-09 04:24:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882756605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:32,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889583919] [2025-01-09 04:24:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:32,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:32,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,855 INFO L87 Difference]: Start difference. First operand 887 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:32,885 INFO L93 Difference]: Finished difference Result 1821 states and 2603 transitions. [2025-01-09 04:24:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:32,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 04:24:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:32,890 INFO L225 Difference]: With dead ends: 1821 [2025-01-09 04:24:32,891 INFO L226 Difference]: Without dead ends: 1323 [2025-01-09 04:24:32,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:32,892 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:32,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-01-09 04:24:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-01-09 04:24:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.406060606060606) internal successors, (1856), 1320 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1856 transitions. [2025-01-09 04:24:32,946 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1856 transitions. Word has length 47 [2025-01-09 04:24:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:32,947 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1856 transitions. [2025-01-09 04:24:32,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1856 transitions. [2025-01-09 04:24:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:24:32,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:32,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:32,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:24:32,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:32,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1730647040, now seen corresponding path program 1 times [2025-01-09 04:24:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:32,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33031389] [2025-01-09 04:24:32,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:32,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:24:32,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:24:32,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:32,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:24:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33031389] [2025-01-09 04:24:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33031389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:33,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:24:33,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465135393] [2025-01-09 04:24:33,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:33,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:24:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:33,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:24:33,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:24:33,071 INFO L87 Difference]: Start difference. First operand 1321 states and 1856 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:33,230 INFO L93 Difference]: Finished difference Result 6771 states and 9541 transitions. [2025-01-09 04:24:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:24:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:24:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:33,247 INFO L225 Difference]: With dead ends: 6771 [2025-01-09 04:24:33,248 INFO L226 Difference]: Without dead ends: 5481 [2025-01-09 04:24:33,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:24:33,251 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 332 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:33,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 450 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2025-01-09 04:24:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 2609. [2025-01-09 04:24:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2608 states have (on average 1.401840490797546) internal successors, (3656), 2608 states have internal predecessors, (3656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3656 transitions. [2025-01-09 04:24:33,358 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3656 transitions. Word has length 64 [2025-01-09 04:24:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 3656 transitions. [2025-01-09 04:24:33,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3656 transitions. [2025-01-09 04:24:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:24:33,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:33,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:24:33,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash -484821760, now seen corresponding path program 1 times [2025-01-09 04:24:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:33,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272693125] [2025-01-09 04:24:33,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:33,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:24:33,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:24:33,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:24:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272693125] [2025-01-09 04:24:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272693125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:33,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:33,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:24:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273436423] [2025-01-09 04:24:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:33,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:24:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:33,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:24:33,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:24:33,468 INFO L87 Difference]: Start difference. First operand 2609 states and 3656 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:33,614 INFO L93 Difference]: Finished difference Result 8059 states and 11341 transitions. [2025-01-09 04:24:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:24:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:24:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:33,633 INFO L225 Difference]: With dead ends: 8059 [2025-01-09 04:24:33,633 INFO L226 Difference]: Without dead ends: 6769 [2025-01-09 04:24:33,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:24:33,637 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 354 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:33,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 415 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2025-01-09 04:24:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 4545. [2025-01-09 04:24:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4545 states, 4544 states have (on average 1.3943661971830985) internal successors, (6336), 4544 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 6336 transitions. [2025-01-09 04:24:33,793 INFO L78 Accepts]: Start accepts. Automaton has 4545 states and 6336 transitions. Word has length 64 [2025-01-09 04:24:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 4545 states and 6336 transitions. [2025-01-09 04:24:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4545 states and 6336 transitions. [2025-01-09 04:24:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:24:33,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:33,795 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:24:33,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1296111104, now seen corresponding path program 1 times [2025-01-09 04:24:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245050233] [2025-01-09 04:24:33,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:24:33,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:24:33,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:33,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:24:33,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245050233] [2025-01-09 04:24:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245050233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:33,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:24:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538038747] [2025-01-09 04:24:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:33,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:24:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:33,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:24:33,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:24:33,876 INFO L87 Difference]: Start difference. First operand 4545 states and 6336 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:34,071 INFO L93 Difference]: Finished difference Result 9347 states and 13141 transitions. [2025-01-09 04:24:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:24:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:24:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:34,093 INFO L225 Difference]: With dead ends: 9347 [2025-01-09 04:24:34,093 INFO L226 Difference]: Without dead ends: 8057 [2025-01-09 04:24:34,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:24:34,098 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 342 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:34,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 450 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8057 states. [2025-01-09 04:24:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8057 to 5833. [2025-01-09 04:24:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5832 states have (on average 1.3950617283950617) internal successors, (8136), 5832 states have internal predecessors, (8136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 8136 transitions. [2025-01-09 04:24:34,280 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 8136 transitions. Word has length 64 [2025-01-09 04:24:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:34,280 INFO L471 AbstractCegarLoop]: Abstraction has 5833 states and 8136 transitions. [2025-01-09 04:24:34,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 8136 transitions. [2025-01-09 04:24:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:24:34,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:34,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:34,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:24:34,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:34,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash 492385024, now seen corresponding path program 1 times [2025-01-09 04:24:34,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:34,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959938511] [2025-01-09 04:24:34,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:34,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:24:34,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:24:34,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:34,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:24:34,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:34,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959938511] [2025-01-09 04:24:34,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959938511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:34,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:24:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491385738] [2025-01-09 04:24:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:24:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:34,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:24:34,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:24:34,391 INFO L87 Difference]: Start difference. First operand 5833 states and 8136 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:34,644 INFO L93 Difference]: Finished difference Result 9915 states and 13949 transitions. [2025-01-09 04:24:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:24:34,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:24:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:34,693 INFO L225 Difference]: With dead ends: 9915 [2025-01-09 04:24:34,693 INFO L226 Difference]: Without dead ends: 8985 [2025-01-09 04:24:34,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:24:34,696 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 332 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:34,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 489 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2025-01-09 04:24:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 6761. [2025-01-09 04:24:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3976331360946745) internal successors, (9448), 6760 states have internal predecessors, (9448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9448 transitions. [2025-01-09 04:24:34,865 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9448 transitions. Word has length 64 [2025-01-09 04:24:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:34,865 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9448 transitions. [2025-01-09 04:24:34,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9448 transitions. [2025-01-09 04:24:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:24:34,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:34,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:34,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:24:34,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:34,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -115541864, now seen corresponding path program 1 times [2025-01-09 04:24:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000790480] [2025-01-09 04:24:34,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:24:34,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:24:34,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:34,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000790480] [2025-01-09 04:24:34,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000790480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:34,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205728563] [2025-01-09 04:24:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:34,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:34,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:34,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:34,931 INFO L87 Difference]: Start difference. First operand 6761 states and 9448 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:35,031 INFO L93 Difference]: Finished difference Result 13493 states and 18866 transitions. [2025-01-09 04:24:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:24:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:35,041 INFO L225 Difference]: With dead ends: 13493 [2025-01-09 04:24:35,041 INFO L226 Difference]: Without dead ends: 6763 [2025-01-09 04:24:35,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,047 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:35,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-01-09 04:24:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-01-09 04:24:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3792899408284023) internal successors, (9324), 6760 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9324 transitions. [2025-01-09 04:24:35,202 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9324 transitions. Word has length 65 [2025-01-09 04:24:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:35,202 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9324 transitions. [2025-01-09 04:24:35,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9324 transitions. [2025-01-09 04:24:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:24:35,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:35,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:35,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:24:35,203 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:35,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -349744008, now seen corresponding path program 1 times [2025-01-09 04:24:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:35,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498730093] [2025-01-09 04:24:35,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:35,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:24:35,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:24:35,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:35,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498730093] [2025-01-09 04:24:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498730093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:35,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:35,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225670937] [2025-01-09 04:24:35,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:35,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:35,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:35,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,256 INFO L87 Difference]: Start difference. First operand 6761 states and 9324 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:35,295 INFO L93 Difference]: Finished difference Result 9334 states and 12908 transitions. [2025-01-09 04:24:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:35,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:24:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:35,299 INFO L225 Difference]: With dead ends: 9334 [2025-01-09 04:24:35,299 INFO L226 Difference]: Without dead ends: 2604 [2025-01-09 04:24:35,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,304 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:35,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-01-09 04:24:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2596. [2025-01-09 04:24:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2595 states have (on average 1.373025048169557) internal successors, (3563), 2595 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 3563 transitions. [2025-01-09 04:24:35,345 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 3563 transitions. Word has length 66 [2025-01-09 04:24:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:35,345 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 3563 transitions. [2025-01-09 04:24:35,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3563 transitions. [2025-01-09 04:24:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:24:35,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:35,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:35,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:24:35,346 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -171916406, now seen corresponding path program 1 times [2025-01-09 04:24:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:35,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141950008] [2025-01-09 04:24:35,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:35,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:24:35,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:24:35,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:35,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:35,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:35,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141950008] [2025-01-09 04:24:35,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141950008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:35,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:35,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662774354] [2025-01-09 04:24:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:35,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:35,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,411 INFO L87 Difference]: Start difference. First operand 2596 states and 3563 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:35,473 INFO L93 Difference]: Finished difference Result 3876 states and 5325 transitions. [2025-01-09 04:24:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:24:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:35,476 INFO L225 Difference]: With dead ends: 3876 [2025-01-09 04:24:35,476 INFO L226 Difference]: Without dead ends: 1322 [2025-01-09 04:24:35,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,478 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:35,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-01-09 04:24:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-01-09 04:24:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.350265352539803) internal successors, (1781), 1319 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1781 transitions. [2025-01-09 04:24:35,502 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1781 transitions. Word has length 67 [2025-01-09 04:24:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:35,502 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1781 transitions. [2025-01-09 04:24:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1781 transitions. [2025-01-09 04:24:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:24:35,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:35,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:24:35,503 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:35,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash 541545724, now seen corresponding path program 1 times [2025-01-09 04:24:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:35,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047171873] [2025-01-09 04:24:35,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:35,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:24:35,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:24:35,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:35,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047171873] [2025-01-09 04:24:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047171873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:35,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:35,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:35,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088196981] [2025-01-09 04:24:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:35,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:35,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,572 INFO L87 Difference]: Start difference. First operand 1320 states and 1781 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:35,589 INFO L93 Difference]: Finished difference Result 1962 states and 2652 transitions. [2025-01-09 04:24:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:35,590 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:24:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:35,591 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 04:24:35,591 INFO L226 Difference]: Without dead ends: 684 [2025-01-09 04:24:35,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:35,592 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:35,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-01-09 04:24:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2025-01-09 04:24:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.3230543318649046) internal successors, (901), 681 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 901 transitions. [2025-01-09 04:24:35,609 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 901 transitions. Word has length 69 [2025-01-09 04:24:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:35,609 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 901 transitions. [2025-01-09 04:24:35,609 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 901 transitions. [2025-01-09 04:24:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:24:35,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:35,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:35,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:24:35,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:35,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1347144942, now seen corresponding path program 1 times [2025-01-09 04:24:35,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:35,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049255359] [2025-01-09 04:24:35,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:35,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:24:35,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:24:35,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:35,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:24:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049255359] [2025-01-09 04:24:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049255359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252853182] [2025-01-09 04:24:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:35,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:35,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:35,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:24:35,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:24:35,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:24:35,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:24:35,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:35,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:35,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:24:35,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:24:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:36,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:24:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:36,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252853182] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:24:36,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:24:36,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-01-09 04:24:36,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5929607] [2025-01-09 04:24:36,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:24:36,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 04:24:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:36,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 04:24:36,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:24:36,921 INFO L87 Difference]: Start difference. First operand 682 states and 901 transitions. Second operand has 20 states, 20 states have (on average 9.4) internal successors, (188), 20 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:37,554 INFO L93 Difference]: Finished difference Result 2670 states and 3506 transitions. [2025-01-09 04:24:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:24:37,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.4) internal successors, (188), 20 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:24:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:37,557 INFO L225 Difference]: With dead ends: 2670 [2025-01-09 04:24:37,557 INFO L226 Difference]: Without dead ends: 2030 [2025-01-09 04:24:37,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:24:37,558 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 806 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:37,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 517 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:24:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-01-09 04:24:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1878. [2025-01-09 04:24:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 1.2738412360149174) internal successors, (2391), 1877 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2391 transitions. [2025-01-09 04:24:37,598 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2391 transitions. Word has length 71 [2025-01-09 04:24:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2391 transitions. [2025-01-09 04:24:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.4) internal successors, (188), 20 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2391 transitions. [2025-01-09 04:24:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:24:37,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:37,598 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:37,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:24:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:37,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:37,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1299347284, now seen corresponding path program 1 times [2025-01-09 04:24:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830614555] [2025-01-09 04:24:37,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:24:37,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:24:37,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:38,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830614555] [2025-01-09 04:24:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830614555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401806697] [2025-01-09 04:24:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:38,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:38,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:38,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:24:38,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:24:38,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:24:38,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:24:38,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:38,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:38,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 04:24:38,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:24:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:38,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:24:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:39,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401806697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:24:39,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:24:39,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-01-09 04:24:39,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071808208] [2025-01-09 04:24:39,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:24:39,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:24:39,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:39,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:24:39,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:24:39,766 INFO L87 Difference]: Start difference. First operand 1878 states and 2391 transitions. Second operand has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:41,528 INFO L93 Difference]: Finished difference Result 7882 states and 10093 transitions. [2025-01-09 04:24:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 04:24:41,533 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:24:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:41,542 INFO L225 Difference]: With dead ends: 7882 [2025-01-09 04:24:41,542 INFO L226 Difference]: Without dead ends: 6187 [2025-01-09 04:24:41,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=688, Invalid=2618, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 04:24:41,546 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1852 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:41,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 817 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:24:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2025-01-09 04:24:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 6175. [2025-01-09 04:24:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6174 states have (on average 1.2617427923550373) internal successors, (7790), 6174 states have internal predecessors, (7790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 7790 transitions. [2025-01-09 04:24:41,674 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 7790 transitions. Word has length 72 [2025-01-09 04:24:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:41,674 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 7790 transitions. [2025-01-09 04:24:41,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 7790 transitions. [2025-01-09 04:24:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:24:41,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:41,675 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:41,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:24:41,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:41,879 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:41,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash -749249196, now seen corresponding path program 1 times [2025-01-09 04:24:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594943458] [2025-01-09 04:24:41,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:41,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:41,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:24:41,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:24:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594943458] [2025-01-09 04:24:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594943458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018319208] [2025-01-09 04:24:42,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:42,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:24:42,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:24:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:24:42,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:24:42,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:42,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:42,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:24:42,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:24:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:42,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:24:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018319208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:24:43,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:24:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 04:24:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456453887] [2025-01-09 04:24:43,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:24:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:24:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:43,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:24:43,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:24:43,250 INFO L87 Difference]: Start difference. First operand 6175 states and 7790 transitions. Second operand has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:43,636 INFO L93 Difference]: Finished difference Result 8581 states and 10955 transitions. [2025-01-09 04:24:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:24:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:24:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:43,645 INFO L225 Difference]: With dead ends: 8581 [2025-01-09 04:24:43,648 INFO L226 Difference]: Without dead ends: 3038 [2025-01-09 04:24:43,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:24:43,657 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 464 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:43,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 417 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:24:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2025-01-09 04:24:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 3034. [2025-01-09 04:24:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 1.2670623145400592) internal successors, (3843), 3033 states have internal predecessors, (3843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 3843 transitions. [2025-01-09 04:24:43,775 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 3843 transitions. Word has length 72 [2025-01-09 04:24:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:43,777 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 3843 transitions. [2025-01-09 04:24:43,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 3843 transitions. [2025-01-09 04:24:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:24:43,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:43,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:43,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:24:43,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:43,978 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:43,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:43,978 INFO L85 PathProgramCache]: Analyzing trace with hash -746565440, now seen corresponding path program 1 times [2025-01-09 04:24:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:43,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091035796] [2025-01-09 04:24:43,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:44,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:24:44,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:24:44,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:44,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091035796] [2025-01-09 04:24:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091035796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759576860] [2025-01-09 04:24:44,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:44,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:44,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:44,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:24:44,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:24:44,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:24:44,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:24:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:44,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 04:24:44,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:24:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:47,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:24:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759576860] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:24:50,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:24:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 24] total 50 [2025-01-09 04:24:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247749899] [2025-01-09 04:24:50,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:24:50,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 04:24:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:50,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 04:24:50,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=2033, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 04:24:50,081 INFO L87 Difference]: Start difference. First operand 3034 states and 3843 transitions. Second operand has 50 states, 50 states have (on average 4.0) internal successors, (200), 50 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:54,656 INFO L93 Difference]: Finished difference Result 11930 states and 15369 transitions. [2025-01-09 04:24:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 04:24:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.0) internal successors, (200), 50 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:24:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:54,683 INFO L225 Difference]: With dead ends: 11930 [2025-01-09 04:24:54,683 INFO L226 Difference]: Without dead ends: 9230 [2025-01-09 04:24:54,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3291 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2409, Invalid=8721, Unknown=0, NotChecked=0, Total=11130 [2025-01-09 04:24:54,696 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3179 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3179 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:54,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3179 Valid, 807 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:24:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9230 states. [2025-01-09 04:24:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9230 to 5905. [2025-01-09 04:24:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5905 states, 5904 states have (on average 1.2594850948509486) internal successors, (7436), 5904 states have internal predecessors, (7436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5905 states to 5905 states and 7436 transitions. [2025-01-09 04:24:55,030 INFO L78 Accepts]: Start accepts. Automaton has 5905 states and 7436 transitions. Word has length 73 [2025-01-09 04:24:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:55,030 INFO L471 AbstractCegarLoop]: Abstraction has 5905 states and 7436 transitions. [2025-01-09 04:24:55,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.0) internal successors, (200), 50 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5905 states and 7436 transitions. [2025-01-09 04:24:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:24:55,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:55,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:55,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:24:55,235 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,SelfDestructingSolverStorable21 [2025-01-09 04:24:55,235 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash -683279548, now seen corresponding path program 1 times [2025-01-09 04:24:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720264468] [2025-01-09 04:24:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:55,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:24:55,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:24:55,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:55,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720264468] [2025-01-09 04:24:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720264468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819630839] [2025-01-09 04:24:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:56,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:56,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:56,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:24:56,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:24:56,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:24:56,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:24:56,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:56,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:57,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 04:24:57,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:01,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819630839] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:06,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29, 26] total 79 [2025-01-09 04:25:06,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523380492] [2025-01-09 04:25:06,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:06,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-01-09 04:25:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:06,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-01-09 04:25:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=771, Invalid=5391, Unknown=0, NotChecked=0, Total=6162 [2025-01-09 04:25:06,190 INFO L87 Difference]: Start difference. First operand 5905 states and 7436 transitions. Second operand has 79 states, 79 states have (on average 2.632911392405063) internal successors, (208), 79 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:13,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 04:25:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:40,267 INFO L93 Difference]: Finished difference Result 13239 states and 16867 transitions. [2025-01-09 04:25:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-01-09 04:25:40,267 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.632911392405063) internal successors, (208), 79 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:25:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:40,280 INFO L225 Difference]: With dead ends: 13239 [2025-01-09 04:25:40,280 INFO L226 Difference]: Without dead ends: 10416 [2025-01-09 04:25:40,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8078 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=3977, Invalid=22428, Unknown=1, NotChecked=0, Total=26406 [2025-01-09 04:25:40,288 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2045 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 4102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 4181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 4102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:40,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 2372 Invalid, 4181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 4102 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-01-09 04:25:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10416 states. [2025-01-09 04:25:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10416 to 5922. [2025-01-09 04:25:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 5921 states have (on average 1.2627934470528628) internal successors, (7477), 5921 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 7477 transitions. [2025-01-09 04:25:40,508 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 7477 transitions. Word has length 74 [2025-01-09 04:25:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:40,508 INFO L471 AbstractCegarLoop]: Abstraction has 5922 states and 7477 transitions. [2025-01-09 04:25:40,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.632911392405063) internal successors, (208), 79 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 7477 transitions. [2025-01-09 04:25:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:25:40,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:40,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:25:40,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:25:40,713 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,SelfDestructingSolverStorable22 [2025-01-09 04:25:40,713 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:40,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1357238336, now seen corresponding path program 1 times [2025-01-09 04:25:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636946399] [2025-01-09 04:25:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:40,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:25:40,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:25:40,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:40,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636946399] [2025-01-09 04:25:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636946399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579740314] [2025-01-09 04:25:41,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:41,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:41,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:41,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:25:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:25:41,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:25:41,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:41,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:41,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 04:25:41,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:43,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579740314] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:46,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 23] total 54 [2025-01-09 04:25:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050148209] [2025-01-09 04:25:46,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:46,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 04:25:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:46,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 04:25:46,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2529, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 04:25:46,788 INFO L87 Difference]: Start difference. First operand 5922 states and 7477 transitions. Second operand has 54 states, 54 states have (on average 3.685185185185185) internal successors, (199), 54 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)