./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_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-cn_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 73a02241f62dd5f03e40960bce3ebc0277b0698412736895e26f9644edb13c8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:05:09,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:05:09,950 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:05:09,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:05:09,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:05:09,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:05:09,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:05:09,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:05:09,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:05:09,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:05:09,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:05:09,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:05:09,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:05:09,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:05:09,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:05:09,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:05:09,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:05:09,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:05:09,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:05:09,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:05:09,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:05:09,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:05:09,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:05:09,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:05:09,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:05:09,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:05:09,982 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 -> 73a02241f62dd5f03e40960bce3ebc0277b0698412736895e26f9644edb13c8b [2025-02-05 23:05:10,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:05:10,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:05:10,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:05:10,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:05:10,207 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:05:10,208 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-cn_file-10.i [2025-02-05 23:05:11,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb305ef7/91d02434ed5247e99b6eb2c6b7330451/FLAG433023751 [2025-02-05 23:05:11,705 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:05:11,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-02-05 23:05:11,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb305ef7/91d02434ed5247e99b6eb2c6b7330451/FLAG433023751 [2025-02-05 23:05:11,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb305ef7/91d02434ed5247e99b6eb2c6b7330451 [2025-02-05 23:05:11,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:05:11,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:05:11,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:05:11,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:05:11,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:05:11,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:05:11" (1/1) ... [2025-02-05 23:05:11,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736f61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:11, skipping insertion in model container [2025-02-05 23:05:11,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:05:11" (1/1) ... [2025-02-05 23:05:11,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:05:12,054 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-cn_file-10.i[919,932] [2025-02-05 23:05:12,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:05:12,132 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:05:12,144 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-cn_file-10.i[919,932] [2025-02-05 23:05:12,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:05:12,197 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:05:12,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12 WrapperNode [2025-02-05 23:05:12,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:05:12,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:05:12,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:05:12,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:05:12,203 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:05:12" (1/1) ... [2025-02-05 23:05:12,217 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:05:12" (1/1) ... [2025-02-05 23:05:12,258 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2025-02-05 23:05:12,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:05:12,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:05:12,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:05:12,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:05:12,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,287 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:05:12,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:05:12,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:05:12,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:05:12,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:05:12,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (1/1) ... [2025-02-05 23:05:12,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:05:12,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:05:12,334 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:05:12,337 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:05:12,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:05:12,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:05:12,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:05:12,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:05:12,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:05:12,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:05:12,404 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:05:12,405 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:05:12,790 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc property_#t~bitwise38#1;havoc property_#t~ite40#1;havoc property_#t~bitwise39#1;havoc property_#t~short41#1; [2025-02-05 23:05:12,826 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-05 23:05:12,826 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:05:12,846 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:05:12,846 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:05:12,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:05:12 BoogieIcfgContainer [2025-02-05 23:05:12,847 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:05:12,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:05:12,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:05:12,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:05:12,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:05:11" (1/3) ... [2025-02-05 23:05:12,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fb7408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:05:12, skipping insertion in model container [2025-02-05 23:05:12,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:05:12" (2/3) ... [2025-02-05 23:05:12,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fb7408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:05:12, skipping insertion in model container [2025-02-05 23:05:12,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:05:12" (3/3) ... [2025-02-05 23:05:12,855 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-02-05 23:05:12,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:05:12,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i that has 2 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:05:12,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:05:12,910 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;@1513525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:05:12,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:05:12,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:05:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-05 23:05:12,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:05:12,924 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:12,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:05:12,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:05:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash 328453585, now seen corresponding path program 1 times [2025-02-05 23:05:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:05:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643624987] [2025-02-05 23:05:12,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:05:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:05:13,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 23:05:13,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 23:05:13,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:05:13,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:05:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-05 23:05:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:05:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643624987] [2025-02-05 23:05:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643624987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:05:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470729442] [2025-02-05 23:05:13,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:05:13,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:05:13,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:05:13,264 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:05:13,266 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:05:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 23:05:13,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 23:05:13,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:05:13,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:05:13,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:05:13,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:05:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-05 23:05:13,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:05:13,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470729442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:05:13,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:05:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:05:13,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773658386] [2025-02-05 23:05:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:05:13,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:05:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:05:13,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:05:13,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:05:13,523 INFO L87 Difference]: Start difference. First operand has 145 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:05:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:05:13,570 INFO L93 Difference]: Finished difference Result 284 states and 501 transitions. [2025-02-05 23:05:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:05:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 294 [2025-02-05 23:05:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:05:13,578 INFO L225 Difference]: With dead ends: 284 [2025-02-05 23:05:13,579 INFO L226 Difference]: Without dead ends: 142 [2025-02-05 23:05:13,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 295 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:05:13,585 INFO L435 NwaCegarLoop]: 216 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, 216 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:05:13,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:05:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-05 23:05:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-05 23:05:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 23:05:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 224 transitions. [2025-02-05 23:05:13,623 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 224 transitions. Word has length 294 [2025-02-05 23:05:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:05:13,624 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 224 transitions. [2025-02-05 23:05:13,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:05:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 224 transitions. [2025-02-05 23:05:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-05 23:05:13,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:05:13,628 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:13,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:05:13,828 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:05:13,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:05:13,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:05:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2073207731, now seen corresponding path program 1 times [2025-02-05 23:05:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:05:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326620762] [2025-02-05 23:05:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:05:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:05:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 23:05:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 23:05:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:05:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:05:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:05:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:05:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326620762] [2025-02-05 23:05:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326620762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:05:14,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:05:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:05:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132363727] [2025-02-05 23:05:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:05:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:05:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:05:14,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:05:14,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:05:14,463 INFO L87 Difference]: Start difference. First operand 142 states and 224 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:05:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:05:14,706 INFO L93 Difference]: Finished difference Result 421 states and 667 transitions. [2025-02-05 23:05:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:05:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 294 [2025-02-05 23:05:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:05:14,711 INFO L225 Difference]: With dead ends: 421 [2025-02-05 23:05:14,713 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 23:05:14,717 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:05:14,719 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 134 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:05:14,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 625 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:05:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 23:05:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 223. [2025-02-05 23:05:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 124 states have internal predecessors, (160), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 23:05:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2025-02-05 23:05:14,769 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 294 [2025-02-05 23:05:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:05:14,771 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2025-02-05 23:05:14,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:05:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2025-02-05 23:05:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:05:14,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:05:14,775 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:05:14,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:05:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:05:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1961831888, now seen corresponding path program 1 times [2025-02-05 23:05:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:05:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843878863] [2025-02-05 23:05:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:05:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:05:14,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:05:15,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:05:15,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:05:15,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:06:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:06:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:06:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843878863] [2025-02-05 23:06:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843878863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:06:01,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:06:01,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:06:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643463334] [2025-02-05 23:06:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:06:01,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:06:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:06:01,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:06:01,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:06:01,889 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:06:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:06:03,149 INFO L93 Difference]: Finished difference Result 632 states and 990 transitions. [2025-02-05 23:06:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:06:03,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:06:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:06:03,153 INFO L225 Difference]: With dead ends: 632 [2025-02-05 23:06:03,153 INFO L226 Difference]: Without dead ends: 493 [2025-02-05 23:06:03,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:06:03,154 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 384 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:06:03,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1455 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:06:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-05 23:06:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 401. [2025-02-05 23:06:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 252 states have (on average 1.3611111111111112) internal successors, (343), 253 states have internal predecessors, (343), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-05 23:06:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2025-02-05 23:06:03,193 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 295 [2025-02-05 23:06:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:06:03,195 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2025-02-05 23:06:03,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:06:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2025-02-05 23:06:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:06:03,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:06:03,198 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:06:03,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:06:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:06:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -842694928, now seen corresponding path program 1 times [2025-02-05 23:06:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:06:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735100668] [2025-02-05 23:06:03,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:06:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:06:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:06:03,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:06:03,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:06:03,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:06:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:06:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:06:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735100668] [2025-02-05 23:06:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735100668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:06:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:06:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 23:06:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016517498] [2025-02-05 23:06:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:06:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 23:06:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:06:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 23:06:18,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:06:18,541 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-02-05 23:06:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:06:22,446 INFO L93 Difference]: Finished difference Result 911 states and 1381 transitions. [2025-02-05 23:06:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 23:06:22,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 295 [2025-02-05 23:06:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:06:22,451 INFO L225 Difference]: With dead ends: 911 [2025-02-05 23:06:22,452 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 23:06:22,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2025-02-05 23:06:22,453 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 965 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:06:22,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1907 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 23:06:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 23:06:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 430. [2025-02-05 23:06:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 277 states have (on average 1.3465703971119134) internal successors, (373), 278 states have internal predecessors, (373), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-05 23:06:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 661 transitions. [2025-02-05 23:06:22,487 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 661 transitions. Word has length 295 [2025-02-05 23:06:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:06:22,488 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 661 transitions. [2025-02-05 23:06:22,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-02-05 23:06:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 661 transitions. [2025-02-05 23:06:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:06:22,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:06:22,490 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:22,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:06:22,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:06:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:06:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -359150063, now seen corresponding path program 1 times [2025-02-05 23:06:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:06:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511514714] [2025-02-05 23:06:22,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:06:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:06:22,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:06:22,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:06:22,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:06:22,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:06:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:06:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:06:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511514714] [2025-02-05 23:06:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511514714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:06:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:06:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:06:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335137794] [2025-02-05 23:06:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:06:32,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:06:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:06:32,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:06:32,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:06:32,612 INFO L87 Difference]: Start difference. First operand 430 states and 661 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:06:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:06:33,657 INFO L93 Difference]: Finished difference Result 879 states and 1340 transitions. [2025-02-05 23:06:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:06:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-02-05 23:06:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:06:33,661 INFO L225 Difference]: With dead ends: 879 [2025-02-05 23:06:33,661 INFO L226 Difference]: Without dead ends: 539 [2025-02-05 23:06:33,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:06:33,662 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 455 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:06:33,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1550 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:06:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-05 23:06:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 419. [2025-02-05 23:06:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 266 states have (on average 1.3421052631578947) internal successors, (357), 267 states have internal predecessors, (357), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-05 23:06:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 645 transitions. [2025-02-05 23:06:33,695 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 645 transitions. Word has length 295 [2025-02-05 23:06:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:06:33,697 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 645 transitions. [2025-02-05 23:06:33,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 23:06:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 645 transitions. [2025-02-05 23:06:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:06:33,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:06:33,699 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:33,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:06:33,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:06:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:06:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1088370927, now seen corresponding path program 1 times [2025-02-05 23:06:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:06:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685650555] [2025-02-05 23:06:33,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:06:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:06:33,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:06:33,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:06:33,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:06:33,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:06:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 23:06:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:06:43,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685650555] [2025-02-05 23:06:43,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685650555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:06:43,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:06:43,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:06:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788654272] [2025-02-05 23:06:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:06:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:06:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:06:43,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:06:43,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:06:43,080 INFO L87 Difference]: Start difference. First operand 419 states and 645 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:06:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:06:43,686 INFO L93 Difference]: Finished difference Result 770 states and 1192 transitions. [2025-02-05 23:06:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:06:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-05 23:06:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:06:43,692 INFO L225 Difference]: With dead ends: 770 [2025-02-05 23:06:43,692 INFO L226 Difference]: Without dead ends: 631 [2025-02-05 23:06:43,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:06:43,694 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 474 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:06:43,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1124 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:06:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-05 23:06:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 596. [2025-02-05 23:06:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 393 states have (on average 1.3740458015267176) internal successors, (540), 394 states have internal predecessors, (540), 192 states have call successors, (192), 10 states have call predecessors, (192), 10 states have return successors, (192), 191 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-05 23:06:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 924 transitions. [2025-02-05 23:06:43,735 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 924 transitions. Word has length 295 [2025-02-05 23:06:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:06:43,735 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 924 transitions. [2025-02-05 23:06:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 23:06:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 924 transitions. [2025-02-05 23:06:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-05 23:06:43,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:06:43,737 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:06:43,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:06:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:06:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash 402069553, now seen corresponding path program 1 times [2025-02-05 23:06:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:06:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675736881] [2025-02-05 23:06:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:06:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:06:43,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-05 23:06:43,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-05 23:06:43,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:06:43,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat