./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ec4a99a42fc6f0ccec68ba89670f2fae39f650d22bb1f7fba4edc18d487cd200 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:41:56,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:41:56,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:41:56,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:41:56,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:41:56,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:41:56,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:41:56,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:41:56,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:41:56,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:41:56,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:41:56,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:41:56,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:41:56,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:41:56,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:41:56,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:41:56,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:41:56,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:41:56,457 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/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 -> ec4a99a42fc6f0ccec68ba89670f2fae39f650d22bb1f7fba4edc18d487cd200 [2025-03-03 20:41:56,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:41:56,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:41:56,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:41:56,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:41:56,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:41:56,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i [2025-03-03 20:41:57,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfd0ee68/65f6aaed9e8f4e2db2cb76a8dc34c0ee/FLAG2dafe8c99 [2025-03-03 20:41:58,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:41:58,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i [2025-03-03 20:41:58,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfd0ee68/65f6aaed9e8f4e2db2cb76a8dc34c0ee/FLAG2dafe8c99 [2025-03-03 20:41:58,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfd0ee68/65f6aaed9e8f4e2db2cb76a8dc34c0ee [2025-03-03 20:41:58,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:41:58,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:41:58,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:41:58,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:41:58,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:41:58,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6837c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58, skipping insertion in model container [2025-03-03 20:41:58,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:41:58,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i[919,932] [2025-03-03 20:41:58,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:41:58,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:41:58,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i[919,932] [2025-03-03 20:41:58,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:41:58,733 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:41:58,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58 WrapperNode [2025-03-03 20:41:58,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:41:58,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:41:58,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:41:58,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:41:58,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,766 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-03-03 20:41:58,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:41:58,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:41:58,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:41:58,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:41:58,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,789 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-03-03 20:41:58,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:41:58,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:41:58,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:41:58,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:41:58,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (1/1) ... [2025-03-03 20:41:58,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:41:58,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:41:58,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:41:58,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:41:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:41:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:41:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:41:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:41:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:41:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:41:58,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:41:58,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:41:59,247 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 20:41:59,247 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:41:59,266 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:41:59,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:41:59,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:41:59 BoogieIcfgContainer [2025-03-03 20:41:59,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:41:59,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:41:59,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:41:59,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:41:59,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:41:58" (1/3) ... [2025-03-03 20:41:59,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72f59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:41:59, skipping insertion in model container [2025-03-03 20:41:59,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:41:58" (2/3) ... [2025-03-03 20:41:59,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72f59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:41:59, skipping insertion in model container [2025-03-03 20:41:59,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:41:59" (3/3) ... [2025-03-03 20:41:59,277 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i [2025-03-03 20:41:59,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:41:59,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-52.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:41:59,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:41:59,338 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;@42d2680c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:41:59,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:41:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:41:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:41:59,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:41:59,352 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:41:59,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:41:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:41:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1198585885, now seen corresponding path program 1 times [2025-03-03 20:41:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:41:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171148102] [2025-03-03 20:41:59,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:41:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:41:59,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:41:59,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:41:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:41:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:41:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:41:59,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:41:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171148102] [2025-03-03 20:41:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171148102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:41:59,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174225420] [2025-03-03 20:41:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:41:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:41:59,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:41:59,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:41:59,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:41:59,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:41:59,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:41:59,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:41:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:41:59,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:41:59,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:41:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:41:59,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:41:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174225420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:41:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:41:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:41:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321493776] [2025-03-03 20:41:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:41:59,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:41:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:41:59,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:41:59,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:41:59,907 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:41:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:41:59,936 INFO L93 Difference]: Finished difference Result 202 states and 355 transitions. [2025-03-03 20:41:59,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:41:59,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 218 [2025-03-03 20:41:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:41:59,946 INFO L225 Difference]: With dead ends: 202 [2025-03-03 20:41:59,947 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 20:41:59,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 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-03-03 20:41:59,955 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:41:59,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:41:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 20:41:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-03 20:41:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:41:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2025-03-03 20:41:59,997 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 218 [2025-03-03 20:41:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:41:59,997 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2025-03-03 20:41:59,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:41:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2025-03-03 20:42:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:42:00,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:42:00,001 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:42:00,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:42:00,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:42:00,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:42:00,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:42:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 628099745, now seen corresponding path program 1 times [2025-03-03 20:42:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:42:00,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78503908] [2025-03-03 20:42:00,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:42:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:42:00,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:42:00,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:42:00,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:42:00,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:42:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:42:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:42:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78503908] [2025-03-03 20:42:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78503908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:42:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:42:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:42:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329130095] [2025-03-03 20:42:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:42:00,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:42:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:42:00,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:42:00,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:42:00,837 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:42:01,078 INFO L93 Difference]: Finished difference Result 254 states and 397 transitions. [2025-03-03 20:42:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:42:01,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:42:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:42:01,080 INFO L225 Difference]: With dead ends: 254 [2025-03-03 20:42:01,080 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 20:42:01,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:42:01,081 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 81 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:42:01,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 551 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:42:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 20:42:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-03-03 20:42:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.39) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 20:42:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 239 transitions. [2025-03-03 20:42:01,096 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 239 transitions. Word has length 218 [2025-03-03 20:42:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:42:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 239 transitions. [2025-03-03 20:42:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 239 transitions. [2025-03-03 20:42:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:42:01,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:42:01,103 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:42:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:42:01,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:42:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:42:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 757182464, now seen corresponding path program 1 times [2025-03-03 20:42:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:42:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77197153] [2025-03-03 20:42:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:42:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:42:01,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:42:01,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:42:01,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:42:01,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:42:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:42:01,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:42:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77197153] [2025-03-03 20:42:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77197153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:42:01,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:42:01,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:42:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287670168] [2025-03-03 20:42:01,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:42:01,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:42:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:42:01,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:42:01,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:42:01,352 INFO L87 Difference]: Start difference. First operand 153 states and 239 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:42:01,403 INFO L93 Difference]: Finished difference Result 404 states and 631 transitions. [2025-03-03 20:42:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:42:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:42:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:42:01,408 INFO L225 Difference]: With dead ends: 404 [2025-03-03 20:42:01,410 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 20:42:01,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:42:01,412 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:42:01,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 347 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:42:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 20:42:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2025-03-03 20:42:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 162 states have (on average 1.376543209876543) internal successors, (223), 165 states have internal predecessors, (223), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 20:42:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 391 transitions. [2025-03-03 20:42:01,451 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 391 transitions. Word has length 218 [2025-03-03 20:42:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:42:01,452 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 391 transitions. [2025-03-03 20:42:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 391 transitions. [2025-03-03 20:42:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:42:01,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:42:01,457 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:42:01,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:42:01,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:42:01,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:42:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash 426377578, now seen corresponding path program 1 times [2025-03-03 20:42:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:42:01,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625287499] [2025-03-03 20:42:01,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:42:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:42:01,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:42:01,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:42:01,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:42:01,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:42:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:42:07,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:42:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625287499] [2025-03-03 20:42:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625287499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:42:07,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:42:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:42:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928061263] [2025-03-03 20:42:07,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:42:07,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:42:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:42:07,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:42:07,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:42:07,416 INFO L87 Difference]: Start difference. First operand 251 states and 391 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:42:12,007 INFO L93 Difference]: Finished difference Result 1396 states and 2201 transitions. [2025-03-03 20:42:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 20:42:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:42:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:42:12,016 INFO L225 Difference]: With dead ends: 1396 [2025-03-03 20:42:12,018 INFO L226 Difference]: Without dead ends: 1394 [2025-03-03 20:42:12,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=590, Invalid=1666, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 20:42:12,021 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 1041 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:42:12,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1555 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 20:42:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-03 20:42:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 678. [2025-03-03 20:42:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 501 states have (on average 1.4570858283433135) internal successors, (730), 507 states have internal predecessors, (730), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 20:42:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1066 transitions. [2025-03-03 20:42:12,083 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1066 transitions. Word has length 219 [2025-03-03 20:42:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:42:12,084 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1066 transitions. [2025-03-03 20:42:12,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1066 transitions. [2025-03-03 20:42:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:42:12,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:42:12,086 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:42:12,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:42:12,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:42:12,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:42:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1671142059, now seen corresponding path program 1 times [2025-03-03 20:42:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:42:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807754349] [2025-03-03 20:42:12,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:42:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:42:12,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:42:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:42:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:42:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:42:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:42:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:42:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807754349] [2025-03-03 20:42:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807754349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:42:12,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:42:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:42:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622656930] [2025-03-03 20:42:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:42:12,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:42:12,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:42:12,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:42:12,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:42:12,268 INFO L87 Difference]: Start difference. First operand 678 states and 1066 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:42:12,432 INFO L93 Difference]: Finished difference Result 1970 states and 3119 transitions. [2025-03-03 20:42:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:42:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:42:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:42:12,439 INFO L225 Difference]: With dead ends: 1970 [2025-03-03 20:42:12,439 INFO L226 Difference]: Without dead ends: 1295 [2025-03-03 20:42:12,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03-03 20:42:12,442 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 204 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:42:12,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 596 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:42:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-03-03 20:42:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 742. [2025-03-03 20:42:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 529 states have (on average 1.4328922495274101) internal successors, (758), 536 states have internal predecessors, (758), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 195 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-03 20:42:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1162 transitions. [2025-03-03 20:42:12,521 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1162 transitions. Word has length 219 [2025-03-03 20:42:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:42:12,523 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1162 transitions. [2025-03-03 20:42:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:42:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1162 transitions. [2025-03-03 20:42:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:42:12,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:42:12,527 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:42:12,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:42:12,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:42:12,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:42:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1446067509, now seen corresponding path program 1 times [2025-03-03 20:42:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:42:12,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514623215] [2025-03-03 20:42:12,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:42:12,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:42:12,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:42:12,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:42:12,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:42:12,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat