./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-10.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-pr-co_file-10.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 1d2525c514f5f41938cb8dbff9fda78c478979aa19fdef1a39087aafe1b8a708 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:17:32,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:17:32,630 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:17:32,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:17:32,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:17:32,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:17:32,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:17:32,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:17:32,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:17:32,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:17:32,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:17:32,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:17:32,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:17:32,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:17:32,654 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:17:32,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:17:32,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:17:32,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:17:32,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:17:32,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:17:32,657 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 -> 1d2525c514f5f41938cb8dbff9fda78c478979aa19fdef1a39087aafe1b8a708 [2025-02-05 23:17:32,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:17:32,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:17:32,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:17:32,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:17:32,898 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:17:32,900 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-pr-co_file-10.i [2025-02-05 23:17:34,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36916ef8d/8328d32336bb49118097e795cdb98db2/FLAG208edde7c [2025-02-05 23:17:34,413 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:17:34,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-10.i [2025-02-05 23:17:34,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36916ef8d/8328d32336bb49118097e795cdb98db2/FLAG208edde7c [2025-02-05 23:17:34,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36916ef8d/8328d32336bb49118097e795cdb98db2 [2025-02-05 23:17:34,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:17:34,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:17:34,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:17:34,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:17:34,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:17:34,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:34,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34, skipping insertion in model container [2025-02-05 23:17:34,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:34,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:17:34,825 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-pr-co_file-10.i[919,932] [2025-02-05 23:17:34,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:17:34,912 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:17:34,921 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-pr-co_file-10.i[919,932] [2025-02-05 23:17:34,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:17:34,971 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:17:34,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34 WrapperNode [2025-02-05 23:17:34,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:17:34,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:17:34,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:17:34,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:17:34,978 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:17:34" (1/1) ... [2025-02-05 23:17:34,996 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:17:34" (1/1) ... [2025-02-05 23:17:35,042 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-02-05 23:17:35,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:17:35,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:17:35,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:17:35,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:17:35,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,091 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:17:35,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,105 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:17:35,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:17:35,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:17:35,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:17:35,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (1/1) ... [2025-02-05 23:17:35,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:17:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:17:35,161 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:17:35,164 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:17:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:17:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:17:35,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:17:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:17:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:17:35,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:17:35,259 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:17:35,261 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:17:35,762 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: havoc property_#t~bitwise35#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~short38#1; [2025-02-05 23:17:35,811 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-05 23:17:35,811 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:17:35,839 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:17:35,839 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:17:35,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:17:35 BoogieIcfgContainer [2025-02-05 23:17:35,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:17:35,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:17:35,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:17:35,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:17:35,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:17:34" (1/3) ... [2025-02-05 23:17:35,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725339a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:17:35, skipping insertion in model container [2025-02-05 23:17:35,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:17:34" (2/3) ... [2025-02-05 23:17:35,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725339a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:17:35, skipping insertion in model container [2025-02-05 23:17:35,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:17:35" (3/3) ... [2025-02-05 23:17:35,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-10.i [2025-02-05 23:17:35,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:17:35,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-10.i that has 2 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:17:35,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:17:35,940 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;@164cd5db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:17:35,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:17:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 23:17:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 23:17:35,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:17:35,960 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:35,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:17:35,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:17:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1977191735, now seen corresponding path program 1 times [2025-02-05 23:17:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:17:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684082787] [2025-02-05 23:17:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:17:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:17:36,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 23:17:36,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 23:17:36,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:17:36,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:17:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-05 23:17:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:17:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684082787] [2025-02-05 23:17:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684082787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:17:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642134840] [2025-02-05 23:17:36,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:17:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:17:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:17:36,303 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:17:36,304 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:17:36,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 23:17:36,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 23:17:36,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:17:36,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:17:36,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:17:36,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:17:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-05 23:17:36,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:17:36,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642134840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:17:36,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:17:36,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:17:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823984396] [2025-02-05 23:17:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:17:36,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:17:36,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:17:36,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:17:36,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:17:36,584 INFO L87 Difference]: Start difference. First operand has 136 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:17:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:17:36,620 INFO L93 Difference]: Finished difference Result 266 states and 465 transitions. [2025-02-05 23:17:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:17:36,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 261 [2025-02-05 23:17:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:17:36,628 INFO L225 Difference]: With dead ends: 266 [2025-02-05 23:17:36,628 INFO L226 Difference]: Without dead ends: 133 [2025-02-05 23:17:36,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 262 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:17:36,633 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:17:36,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:17:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-05 23:17:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-05 23:17:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 23:17:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 209 transitions. [2025-02-05 23:17:36,679 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 209 transitions. Word has length 261 [2025-02-05 23:17:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:17:36,679 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 209 transitions. [2025-02-05 23:17:36,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:17:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 209 transitions. [2025-02-05 23:17:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 23:17:36,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:17:36,696 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:36,704 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:17:36,897 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:17:36,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:17:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:17:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1554718117, now seen corresponding path program 1 times [2025-02-05 23:17:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:17:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539886555] [2025-02-05 23:17:36,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:17:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:17:36,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 23:17:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 23:17:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:17:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:17:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:17:37,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:17:37,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539886555] [2025-02-05 23:17:37,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539886555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:17:37,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:17:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:17:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390989999] [2025-02-05 23:17:37,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:17:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:17:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:17:37,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:17:37,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:17:37,661 INFO L87 Difference]: Start difference. First operand 133 states and 209 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:17:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:17:37,937 INFO L93 Difference]: Finished difference Result 394 states and 622 transitions. [2025-02-05 23:17:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:17:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 261 [2025-02-05 23:17:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:17:37,941 INFO L225 Difference]: With dead ends: 394 [2025-02-05 23:17:37,941 INFO L226 Difference]: Without dead ends: 264 [2025-02-05 23:17:37,942 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:17:37,943 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 131 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:17:37,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 574 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:17:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-05 23:17:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 205. [2025-02-05 23:17:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 23:17:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 322 transitions. [2025-02-05 23:17:37,977 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 322 transitions. Word has length 261 [2025-02-05 23:17:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:17:37,977 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 322 transitions. [2025-02-05 23:17:37,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:17:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 322 transitions. [2025-02-05 23:17:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 23:17:37,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:17:37,983 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:17:37,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:17:37,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:17:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash 855140738, now seen corresponding path program 1 times [2025-02-05 23:17:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:17:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918044124] [2025-02-05 23:17:37,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:17:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:17:38,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 23:17:38,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 23:17:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:17:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:17:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:17:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:17:54,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918044124] [2025-02-05 23:17:54,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918044124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:17:54,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:17:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:17:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281192356] [2025-02-05 23:17:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:17:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:17:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:17:54,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:17:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:17:54,975 INFO L87 Difference]: Start difference. First operand 205 states and 322 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:17:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:17:57,024 INFO L93 Difference]: Finished difference Result 715 states and 1105 transitions. [2025-02-05 23:17:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 23:17:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 23:17:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:17:57,032 INFO L225 Difference]: With dead ends: 715 [2025-02-05 23:17:57,032 INFO L226 Difference]: Without dead ends: 585 [2025-02-05 23:17:57,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2025-02-05 23:17:57,035 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1005 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:17:57,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1082 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:17:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-05 23:17:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 348. [2025-02-05 23:17:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 258 states have (on average 1.4186046511627908) internal successors, (366), 259 states have internal predecessors, (366), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 23:17:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 538 transitions. [2025-02-05 23:17:57,084 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 538 transitions. Word has length 262 [2025-02-05 23:17:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:17:57,088 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 538 transitions. [2025-02-05 23:17:57,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:17:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 538 transitions. [2025-02-05 23:17:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 23:17:57,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:17:57,091 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:57,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:17:57,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:17:57,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:17:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1092285122, now seen corresponding path program 1 times [2025-02-05 23:17:57,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:17:57,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550476160] [2025-02-05 23:17:57,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:17:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:17:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 23:17:57,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 23:17:57,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:17:57,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:18:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550476160] [2025-02-05 23:18:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550476160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:18:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455113074] [2025-02-05 23:18:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:18:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:12,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:18:12,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:18:12,416 INFO L87 Difference]: Start difference. First operand 348 states and 538 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:18:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:13,617 INFO L93 Difference]: Finished difference Result 968 states and 1480 transitions. [2025-02-05 23:18:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:18:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 23:18:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:13,624 INFO L225 Difference]: With dead ends: 968 [2025-02-05 23:18:13,624 INFO L226 Difference]: Without dead ends: 623 [2025-02-05 23:18:13,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:18:13,625 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 467 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:13,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1070 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:18:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-05 23:18:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 488. [2025-02-05 23:18:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 352 states have (on average 1.3948863636363635) internal successors, (491), 354 states have internal predecessors, (491), 130 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-05 23:18:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 751 transitions. [2025-02-05 23:18:13,668 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 751 transitions. Word has length 262 [2025-02-05 23:18:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 751 transitions. [2025-02-05 23:18:13,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:18:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 751 transitions. [2025-02-05 23:18:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 23:18:13,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:13,671 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:13,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:18:13,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:13,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1575829987, now seen corresponding path program 1 times [2025-02-05 23:18:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:13,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769191160] [2025-02-05 23:18:13,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:13,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 23:18:13,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 23:18:13,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:13,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:18:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769191160] [2025-02-05 23:18:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769191160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 23:18:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843564574] [2025-02-05 23:18:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 23:18:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:15,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 23:18:15,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:18:15,360 INFO L87 Difference]: Start difference. First operand 488 states and 751 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:18:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:16,423 INFO L93 Difference]: Finished difference Result 1088 states and 1666 transitions. [2025-02-05 23:18:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:18:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 23:18:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:16,427 INFO L225 Difference]: With dead ends: 1088 [2025-02-05 23:18:16,428 INFO L226 Difference]: Without dead ends: 607 [2025-02-05 23:18:16,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:18:16,433 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 403 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:16,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1477 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:18:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-05 23:18:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 486. [2025-02-05 23:18:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 352 states have internal predecessors, (488), 130 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-05 23:18:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 748 transitions. [2025-02-05 23:18:16,484 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 748 transitions. Word has length 262 [2025-02-05 23:18:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 748 transitions. [2025-02-05 23:18:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:18:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 748 transitions. [2025-02-05 23:18:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 23:18:16,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:16,490 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:18:16,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:16,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2099905219, now seen corresponding path program 1 times [2025-02-05 23:18:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36006772] [2025-02-05 23:18:16,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 23:18:16,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 23:18:16,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:16,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:18:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36006772] [2025-02-05 23:18:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36006772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 23:18:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556189717] [2025-02-05 23:18:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 23:18:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:19,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 23:18:19,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:18:19,058 INFO L87 Difference]: Start difference. First operand 486 states and 748 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:18:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:20,179 INFO L93 Difference]: Finished difference Result 1259 states and 1935 transitions. [2025-02-05 23:18:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 23:18:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 262 [2025-02-05 23:18:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:20,185 INFO L225 Difference]: With dead ends: 1259 [2025-02-05 23:18:20,185 INFO L226 Difference]: Without dead ends: 914 [2025-02-05 23:18:20,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:18:20,187 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 441 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:20,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1970 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 23:18:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-02-05 23:18:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 687. [2025-02-05 23:18:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 466 states have (on average 1.3626609442060085) internal successors, (635), 467 states have internal predecessors, (635), 212 states have call successors, (212), 8 states have call predecessors, (212), 8 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 23:18:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1059 transitions. [2025-02-05 23:18:20,231 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1059 transitions. Word has length 262 [2025-02-05 23:18:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:20,231 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1059 transitions. [2025-02-05 23:18:20,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:18:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1059 transitions. [2025-02-05 23:18:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 23:18:20,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:20,234 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:18:20,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:20,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1957917693, now seen corresponding path program 1 times [2025-02-05 23:18:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067673411] [2025-02-05 23:18:20,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:20,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 23:18:20,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 23:18:20,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:20,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:18:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067673411] [2025-02-05 23:18:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067673411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:18:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187034625] [2025-02-05 23:18:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:21,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:18:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:21,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:18:21,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:18:21,755 INFO L87 Difference]: Start difference. First operand 687 states and 1059 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:18:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:23,312 INFO L93 Difference]: Finished difference Result 1426 states and 2168 transitions. [2025-02-05 23:18:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 23:18:23,313 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 262 [2025-02-05 23:18:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:23,318 INFO L225 Difference]: With dead ends: 1426 [2025-02-05 23:18:23,318 INFO L226 Difference]: Without dead ends: 949 [2025-02-05 23:18:23,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:18:23,320 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 472 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:23,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2119 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:18:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-02-05 23:18:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 703. [2025-02-05 23:18:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 480 states have (on average 1.35625) internal successors, (651), 481 states have internal predecessors, (651), 212 states have call successors, (212), 10 states have call predecessors, (212), 10 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 23:18:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1075 transitions. [2025-02-05 23:18:23,362 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1075 transitions. Word has length 262 [2025-02-05 23:18:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:23,363 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1075 transitions. [2025-02-05 23:18:23,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:18:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1075 transitions. [2025-02-05 23:18:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 23:18:23,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:23,364 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:18:23,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:23,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1828834974, now seen corresponding path program 1 times [2025-02-05 23:18:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459588100] [2025-02-05 23:18:23,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:23,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 23:18:23,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 23:18:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:18:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459588100] [2025-02-05 23:18:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459588100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:24,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:18:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769680710] [2025-02-05 23:18:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:24,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:18:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:24,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:18:24,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:18:24,799 INFO L87 Difference]: Start difference. First operand 703 states and 1075 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:18:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:26,721 INFO L93 Difference]: Finished difference Result 1517 states and 2277 transitions. [2025-02-05 23:18:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 23:18:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 262 [2025-02-05 23:18:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:26,727 INFO L225 Difference]: With dead ends: 1517 [2025-02-05 23:18:26,727 INFO L226 Difference]: Without dead ends: 1028 [2025-02-05 23:18:26,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2025-02-05 23:18:26,729 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 468 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:26,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2114 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 23:18:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-05 23:18:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 705. [2025-02-05 23:18:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 480 states have (on average 1.3520833333333333) internal successors, (649), 481 states have internal predecessors, (649), 212 states have call successors, (212), 12 states have call predecessors, (212), 12 states have return successors, (212), 211 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 23:18:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1073 transitions. [2025-02-05 23:18:26,772 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1073 transitions. Word has length 262 [2025-02-05 23:18:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:26,773 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1073 transitions. [2025-02-05 23:18:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:18:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1073 transitions. [2025-02-05 23:18:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 23:18:26,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:26,776 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:18:26,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash -883444401, now seen corresponding path program 1 times [2025-02-05 23:18:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224978636] [2025-02-05 23:18:26,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 23:18:26,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 23:18:26,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat