./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i -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 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:33:00,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:33:01,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:33:01,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:33:01,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:33:01,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:33:01,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:33:01,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:33:01,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:33:01,068 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:33:01,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:33:01,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:33:01,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:33:01,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:33:01,069 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:33:01,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:33:01,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:33:01,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:33:01,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:33:01,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:33:01,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:33:01,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:33:01,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:33:01,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:33:01,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:33:01,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:33:01,073 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 -> 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 [2025-02-05 23:33:01,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:33:01,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:33:01,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:33:01,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:33:01,387 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:33:01,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-02-05 23:33:02,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f87f5c60/e5255f47970b44ecae4ef4b546b57302/FLAG14c9cb93f [2025-02-05 23:33:03,016 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:33:03,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-02-05 23:33:03,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f87f5c60/e5255f47970b44ecae4ef4b546b57302/FLAG14c9cb93f [2025-02-05 23:33:03,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f87f5c60/e5255f47970b44ecae4ef4b546b57302 [2025-02-05 23:33:03,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:33:03,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:33:03,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:33:03,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:33:03,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:33:03,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21850e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03, skipping insertion in model container [2025-02-05 23:33:03,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:33:03,224 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i[919,932] [2025-02-05 23:33:03,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:33:03,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:33:03,341 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i[919,932] [2025-02-05 23:33:03,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:33:03,397 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:33:03,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03 WrapperNode [2025-02-05 23:33:03,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:33:03,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:33:03,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:33:03,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:33:03,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,472 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-02-05 23:33:03,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:33:03,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:33:03,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:33:03,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:33:03,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,518 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:33:03,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:33:03,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:33:03,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:33:03,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:33:03,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (1/1) ... [2025-02-05 23:33:03,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:33:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:33:03,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:33:03,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:33:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:33:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:33:03,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:33:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:33:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:33:03,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:33:03,713 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:33:03,716 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:33:04,223 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-02-05 23:33:04,276 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 23:33:04,276 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:33:04,299 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:33:04,299 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:33:04,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:04 BoogieIcfgContainer [2025-02-05 23:33:04,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:33:04,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:33:04,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:33:04,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:33:04,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:33:03" (1/3) ... [2025-02-05 23:33:04,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc748e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:04, skipping insertion in model container [2025-02-05 23:33:04,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:33:03" (2/3) ... [2025-02-05 23:33:04,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc748e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:33:04, skipping insertion in model container [2025-02-05 23:33:04,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:33:04" (3/3) ... [2025-02-05 23:33:04,310 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-02-05 23:33:04,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:33:04,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:33:04,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:33:04,405 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;@10c48092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:33:04,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:33:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 23:33:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 23:33:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:04,425 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:04,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash -866593294, now seen corresponding path program 1 times [2025-02-05 23:33:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070544683] [2025-02-05 23:33:04,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:04,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:33:04,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:33:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-05 23:33:04,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070544683] [2025-02-05 23:33:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070544683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:33:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833760266] [2025-02-05 23:33:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:33:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:33:04,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:33:04,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:33:04,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:33:04,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:33:04,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:04,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:33:05,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:33:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-05 23:33:05,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:33:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833760266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:05,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:33:05,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:33:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286400643] [2025-02-05 23:33:05,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:05,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:33:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:33:05,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:33:05,061 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 23:33:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:05,100 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-02-05 23:33:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:33:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-02-05 23:33:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:05,111 INFO L225 Difference]: With dead ends: 178 [2025-02-05 23:33:05,112 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 23:33:05,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-02-05 23:33:05,121 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:05,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:33:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 23:33:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 23:33:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 23:33:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-02-05 23:33:05,156 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 141 [2025-02-05 23:33:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:05,157 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-02-05 23:33:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 23:33:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-02-05 23:33:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 23:33:05,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:05,163 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:05,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:33:05,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:33:05,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 509729172, now seen corresponding path program 1 times [2025-02-05 23:33:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525681670] [2025-02-05 23:33:05,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:05,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 23:33:05,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 23:33:05,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:05,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:06,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525681670] [2025-02-05 23:33:06,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525681670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:06,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:33:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680953585] [2025-02-05 23:33:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:06,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:33:06,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:06,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:33:06,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:33:06,024 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:06,244 INFO L93 Difference]: Finished difference Result 291 states and 456 transitions. [2025-02-05 23:33:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:33:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-02-05 23:33:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:06,248 INFO L225 Difference]: With dead ends: 291 [2025-02-05 23:33:06,250 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 23:33:06,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:33:06,253 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 165 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:06,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 421 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:33:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 23:33:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 175. [2025-02-05 23:33:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 23:33:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2025-02-05 23:33:06,292 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 141 [2025-02-05 23:33:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2025-02-05 23:33:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2025-02-05 23:33:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 23:33:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:06,295 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:33:06,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2059868363, now seen corresponding path program 1 times [2025-02-05 23:33:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292336975] [2025-02-05 23:33:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:06,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 23:33:06,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 23:33:06,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:06,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292336975] [2025-02-05 23:33:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292336975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:33:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93592954] [2025-02-05 23:33:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:06,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:33:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:06,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:33:06,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:33:06,650 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:07,009 INFO L93 Difference]: Finished difference Result 514 states and 808 transitions. [2025-02-05 23:33:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:33:07,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-02-05 23:33:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:07,014 INFO L225 Difference]: With dead ends: 514 [2025-02-05 23:33:07,014 INFO L226 Difference]: Without dead ends: 342 [2025-02-05 23:33:07,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:33:07,016 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 177 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:07,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 520 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:33:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-05 23:33:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 179. [2025-02-05 23:33:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 23:33:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2025-02-05 23:33:07,058 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 142 [2025-02-05 23:33:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2025-02-05 23:33:07,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2025-02-05 23:33:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 23:33:07,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:07,061 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:07,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:33:07,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -506455536, now seen corresponding path program 1 times [2025-02-05 23:33:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:07,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106181064] [2025-02-05 23:33:07,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 23:33:07,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 23:33:07,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:07,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106181064] [2025-02-05 23:33:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106181064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:33:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567591874] [2025-02-05 23:33:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:07,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:33:07,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:07,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:33:07,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:33:07,701 INFO L87 Difference]: Start difference. First operand 179 states and 279 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:08,029 INFO L93 Difference]: Finished difference Result 474 states and 737 transitions. [2025-02-05 23:33:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:33:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 23:33:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:08,033 INFO L225 Difference]: With dead ends: 474 [2025-02-05 23:33:08,033 INFO L226 Difference]: Without dead ends: 298 [2025-02-05 23:33:08,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:33:08,037 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:08,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 334 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:33:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-05 23:33:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2025-02-05 23:33:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 178 states have (on average 1.449438202247191) internal successors, (258), 178 states have internal predecessors, (258), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:33:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 378 transitions. [2025-02-05 23:33:08,086 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 378 transitions. Word has length 143 [2025-02-05 23:33:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:08,086 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 378 transitions. [2025-02-05 23:33:08,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 378 transitions. [2025-02-05 23:33:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 23:33:08,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:08,088 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:08,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:33:08,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:08,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash -896911, now seen corresponding path program 1 times [2025-02-05 23:33:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:08,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257920421] [2025-02-05 23:33:08,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:08,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:08,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 23:33:08,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 23:33:08,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:08,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257920421] [2025-02-05 23:33:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257920421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:10,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:33:10,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527964567] [2025-02-05 23:33:10,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:33:10,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:33:10,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:33:10,003 INFO L87 Difference]: Start difference. First operand 242 states and 378 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:10,503 INFO L93 Difference]: Finished difference Result 482 states and 747 transitions. [2025-02-05 23:33:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:33:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 23:33:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:10,506 INFO L225 Difference]: With dead ends: 482 [2025-02-05 23:33:10,506 INFO L226 Difference]: Without dead ends: 306 [2025-02-05 23:33:10,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:33:10,511 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 186 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:10,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 448 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:33:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-05 23:33:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2025-02-05 23:33:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 184 states have (on average 1.4456521739130435) internal successors, (266), 184 states have internal predecessors, (266), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:33:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 386 transitions. [2025-02-05 23:33:10,547 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 386 transitions. Word has length 143 [2025-02-05 23:33:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:10,548 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 386 transitions. [2025-02-05 23:33:10,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 386 transitions. [2025-02-05 23:33:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 23:33:10,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:10,550 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:10,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:33:10,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:10,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1550471604, now seen corresponding path program 1 times [2025-02-05 23:33:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:10,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824234545] [2025-02-05 23:33:10,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:10,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 23:33:10,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 23:33:10,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:10,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:40,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824234545] [2025-02-05 23:33:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824234545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:40,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:40,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 23:33:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347662549] [2025-02-05 23:33:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:40,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 23:33:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:40,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 23:33:40,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:33:40,157 INFO L87 Difference]: Start difference. First operand 248 states and 386 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 23:33:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:45,390 INFO L93 Difference]: Finished difference Result 677 states and 1020 transitions. [2025-02-05 23:33:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 23:33:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-02-05 23:33:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:45,395 INFO L225 Difference]: With dead ends: 677 [2025-02-05 23:33:45,396 INFO L226 Difference]: Without dead ends: 482 [2025-02-05 23:33:45,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-02-05 23:33:45,399 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 595 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:45,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1047 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 23:33:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-05 23:33:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 333. [2025-02-05 23:33:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 269 states have (on average 1.449814126394052) internal successors, (390), 269 states have internal predecessors, (390), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:33:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 510 transitions. [2025-02-05 23:33:45,439 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 510 transitions. Word has length 143 [2025-02-05 23:33:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:45,440 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 510 transitions. [2025-02-05 23:33:45,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 23:33:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 510 transitions. [2025-02-05 23:33:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 23:33:45,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:45,442 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:45,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:33:45,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:45,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash -662967923, now seen corresponding path program 1 times [2025-02-05 23:33:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077217102] [2025-02-05 23:33:45,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:45,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 23:33:45,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 23:33:45,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:45,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:47,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077217102] [2025-02-05 23:33:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077217102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:47,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:33:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719339184] [2025-02-05 23:33:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:47,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:33:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:47,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:33:47,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:33:47,631 INFO L87 Difference]: Start difference. First operand 333 states and 510 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:48,433 INFO L93 Difference]: Finished difference Result 746 states and 1127 transitions. [2025-02-05 23:33:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:33:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 23:33:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:48,437 INFO L225 Difference]: With dead ends: 746 [2025-02-05 23:33:48,437 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 23:33:48,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:33:48,440 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 368 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:48,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 506 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:33:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 23:33:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 412. [2025-02-05 23:33:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 348 states have (on average 1.4252873563218391) internal successors, (496), 348 states have internal predecessors, (496), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:33:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 616 transitions. [2025-02-05 23:33:48,485 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 616 transitions. Word has length 143 [2025-02-05 23:33:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:48,485 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 616 transitions. [2025-02-05 23:33:48,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:33:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 616 transitions. [2025-02-05 23:33:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 23:33:48,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:48,487 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:48,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:33:48,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:48,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 937041229, now seen corresponding path program 1 times [2025-02-05 23:33:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:48,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428505652] [2025-02-05 23:33:48,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:48,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 23:33:48,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 23:33:48,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:48,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428505652] [2025-02-05 23:33:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428505652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:49,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 23:33:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313161686] [2025-02-05 23:33:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:49,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:33:49,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:49,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:33:49,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:33:49,906 INFO L87 Difference]: Start difference. First operand 412 states and 616 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 23:33:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:33:50,768 INFO L93 Difference]: Finished difference Result 766 states and 1137 transitions. [2025-02-05 23:33:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:33:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-02-05 23:33:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:33:50,773 INFO L225 Difference]: With dead ends: 766 [2025-02-05 23:33:50,774 INFO L226 Difference]: Without dead ends: 570 [2025-02-05 23:33:50,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:33:50,776 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 410 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:33:50,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 632 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:33:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-05 23:33:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 422. [2025-02-05 23:33:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 358 states have (on average 1.4273743016759777) internal successors, (511), 358 states have internal predecessors, (511), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:33:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 631 transitions. [2025-02-05 23:33:50,807 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 631 transitions. Word has length 143 [2025-02-05 23:33:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:33:50,807 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 631 transitions. [2025-02-05 23:33:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 23:33:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 631 transitions. [2025-02-05 23:33:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 23:33:50,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:33:50,809 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:33:50,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:33:50,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:33:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:33:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2061005781, now seen corresponding path program 1 times [2025-02-05 23:33:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:33:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831180424] [2025-02-05 23:33:50,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:33:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:33:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 23:33:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 23:33:50,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:33:50,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:33:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:33:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:33:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831180424] [2025-02-05 23:33:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831180424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:33:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:33:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:33:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807520995] [2025-02-05 23:33:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:33:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:33:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:33:58,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:33:58,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:33:58,235 INFO L87 Difference]: Start difference. First operand 422 states and 631 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:34:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:01,579 INFO L93 Difference]: Finished difference Result 768 states and 1136 transitions. [2025-02-05 23:34:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 23:34:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 23:34:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:01,581 INFO L225 Difference]: With dead ends: 768 [2025-02-05 23:34:01,581 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 23:34:01,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-02-05 23:34:01,583 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 321 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:01,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1007 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 23:34:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 23:34:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 447. [2025-02-05 23:34:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 383 states have (on average 1.4360313315926894) internal successors, (550), 383 states have internal predecessors, (550), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:34:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 670 transitions. [2025-02-05 23:34:01,615 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 670 transitions. Word has length 143 [2025-02-05 23:34:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:01,616 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 670 transitions. [2025-02-05 23:34:01,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:34:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 670 transitions. [2025-02-05 23:34:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 23:34:01,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:01,618 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:01,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:34:01,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:01,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash -408568730, now seen corresponding path program 1 times [2025-02-05 23:34:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132230455] [2025-02-05 23:34:01,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 23:34:01,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 23:34:01,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:01,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:34:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132230455] [2025-02-05 23:34:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132230455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:34:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742975439] [2025-02-05 23:34:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:14,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:34:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:14,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:34:14,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:34:14,730 INFO L87 Difference]: Start difference. First operand 447 states and 670 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:34:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:15,379 INFO L93 Difference]: Finished difference Result 946 states and 1401 transitions. [2025-02-05 23:34:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:34:15,380 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-02-05 23:34:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:15,384 INFO L225 Difference]: With dead ends: 946 [2025-02-05 23:34:15,384 INFO L226 Difference]: Without dead ends: 770 [2025-02-05 23:34:15,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:34:15,386 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 224 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:15,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 925 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:34:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-02-05 23:34:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 604. [2025-02-05 23:34:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 533 states have (on average 1.4165103189493433) internal successors, (755), 534 states have internal predecessors, (755), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-05 23:34:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 885 transitions. [2025-02-05 23:34:15,423 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 885 transitions. Word has length 144 [2025-02-05 23:34:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:15,423 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 885 transitions. [2025-02-05 23:34:15,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:34:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 885 transitions. [2025-02-05 23:34:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 23:34:15,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:15,427 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:15,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:34:15,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash 944740967, now seen corresponding path program 1 times [2025-02-05 23:34:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829903813] [2025-02-05 23:34:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 23:34:15,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 23:34:15,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:34:16,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:16,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829903813] [2025-02-05 23:34:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829903813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:16,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:16,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 23:34:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959918265] [2025-02-05 23:34:16,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:16,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 23:34:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:16,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 23:34:16,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:34:16,541 INFO L87 Difference]: Start difference. First operand 604 states and 885 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:34:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:17,132 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2025-02-05 23:34:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:34:17,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-02-05 23:34:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:17,136 INFO L225 Difference]: With dead ends: 913 [2025-02-05 23:34:17,136 INFO L226 Difference]: Without dead ends: 775 [2025-02-05 23:34:17,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:34:17,137 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 332 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:17,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1108 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:34:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-05 23:34:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 674. [2025-02-05 23:34:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 587 states have (on average 1.41396933560477) internal successors, (830), 587 states have internal predecessors, (830), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 23:34:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 990 transitions. [2025-02-05 23:34:17,176 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 990 transitions. Word has length 144 [2025-02-05 23:34:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:17,176 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 990 transitions. [2025-02-05 23:34:17,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 23:34:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 990 transitions. [2025-02-05 23:34:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 23:34:17,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:17,178 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:17,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:34:17,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:17,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash 60685056, now seen corresponding path program 1 times [2025-02-05 23:34:17,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:17,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071969348] [2025-02-05 23:34:17,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:17,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 23:34:17,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 23:34:17,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:17,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 23:34:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071969348] [2025-02-05 23:34:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071969348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:20,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:20,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:34:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259020071] [2025-02-05 23:34:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:34:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:20,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:34:20,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:34:20,126 INFO L87 Difference]: Start difference. First operand 674 states and 990 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)