./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-pr-cn_file-33.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 10c24f006156daba0f87adc85da926a7bfe9ad7c7769d678846bdde773fb38c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:33:17,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:33:17,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:33:17,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:33:17,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:33:17,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:33:17,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:33:17,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:33:17,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:33:17,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:33:17,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:33:17,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:33:17,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:33:17,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:33:17,551 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:33:17,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:33:17,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:33:17,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:33:17,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:33:17,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:33:17,555 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 -> 10c24f006156daba0f87adc85da926a7bfe9ad7c7769d678846bdde773fb38c1 [2025-03-17 01:33:17,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:33:17,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:33:17,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:33:17,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:33:17,814 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:33:17,815 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-pr-cn_file-33.i [2025-03-17 01:33:18,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a622e3d/00e4c1bbe57d4cfd8119bcd2b99c7f35/FLAGa4063ce13 [2025-03-17 01:33:19,248 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:33:19,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-33.i [2025-03-17 01:33:19,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a622e3d/00e4c1bbe57d4cfd8119bcd2b99c7f35/FLAGa4063ce13 [2025-03-17 01:33:19,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a622e3d/00e4c1bbe57d4cfd8119bcd2b99c7f35 [2025-03-17 01:33:19,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:33:19,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:33:19,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:33:19,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:33:19,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:33:19,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1640e41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19, skipping insertion in model container [2025-03-17 01:33:19,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:33:19,658 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-pr-cn_file-33.i[919,932] [2025-03-17 01:33:19,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:33:19,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:33:19,762 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-pr-cn_file-33.i[919,932] [2025-03-17 01:33:19,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:33:19,815 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:33:19,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19 WrapperNode [2025-03-17 01:33:19,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:33:19,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:33:19,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:33:19,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:33:19,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,854 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2025-03-17 01:33:19,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:33:19,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:33:19,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:33:19,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:33:19,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,883 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-17 01:33:19,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:33:19,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:33:19,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:33:19,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:33:19,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (1/1) ... [2025-03-17 01:33:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:33:19,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:33:19,934 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-17 01:33:19,939 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-17 01:33:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:33:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:33:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:33:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:33:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:33:19,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:33:20,019 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:33:20,021 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:33:20,323 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1; [2025-03-17 01:33:20,352 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 01:33:20,352 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:33:20,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:33:20,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:33:20,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:33:20 BoogieIcfgContainer [2025-03-17 01:33:20,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:33:20,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:33:20,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:33:20,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:33:20,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:33:19" (1/3) ... [2025-03-17 01:33:20,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d151c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:33:20, skipping insertion in model container [2025-03-17 01:33:20,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:33:19" (2/3) ... [2025-03-17 01:33:20,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d151c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:33:20, skipping insertion in model container [2025-03-17 01:33:20,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:33:20" (3/3) ... [2025-03-17 01:33:20,372 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-33.i [2025-03-17 01:33:20,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:33:20,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-33.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:33:20,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:33:20,437 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;@4edac30f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:33:20,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:33:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 01:33:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-17 01:33:20,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:33:20,455 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:33:20,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:33:20,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:33:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash 315260261, now seen corresponding path program 1 times [2025-03-17 01:33:20,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:33:20,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94156626] [2025-03-17 01:33:20,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:33:20,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-17 01:33:20,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-17 01:33:20,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:20,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-17 01:33:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:33:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94156626] [2025-03-17 01:33:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94156626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:33:20,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810106260] [2025-03-17 01:33:20,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:20,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:33:20,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:33:20,823 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-17 01:33:20,825 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-17 01:33:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-17 01:33:20,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-17 01:33:20,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:20,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:20,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:33:20,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:33:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-17 01:33:21,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:33:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810106260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:33:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:33:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:33:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565365880] [2025-03-17 01:33:21,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:33:21,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:33:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:33:21,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:33:21,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:33:21,036 INFO L87 Difference]: Start difference. First operand has 108 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-17 01:33:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:33:21,061 INFO L93 Difference]: Finished difference Result 211 states and 382 transitions. [2025-03-17 01:33:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:33:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 255 [2025-03-17 01:33:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:33:21,070 INFO L225 Difference]: With dead ends: 211 [2025-03-17 01:33:21,070 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 01:33:21,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 256 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-17 01:33:21,074 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:33:21,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:33:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 01:33:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 01:33:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 01:33:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 162 transitions. [2025-03-17 01:33:21,120 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 162 transitions. Word has length 255 [2025-03-17 01:33:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:33:21,121 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 162 transitions. [2025-03-17 01:33:21,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-17 01:33:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 162 transitions. [2025-03-17 01:33:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-17 01:33:21,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:33:21,128 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:33:21,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:33:21,328 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-17 01:33:21,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:33:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:33:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1288601565, now seen corresponding path program 1 times [2025-03-17 01:33:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:33:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643797702] [2025-03-17 01:33:21,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:33:21,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-17 01:33:21,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-17 01:33:21,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-17 01:33:22,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:33:22,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643797702] [2025-03-17 01:33:22,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643797702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:33:22,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:33:22,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:33:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98002899] [2025-03-17 01:33:22,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:33:22,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:33:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:33:22,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:33:22,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:33:22,251 INFO L87 Difference]: Start difference. First operand 104 states and 162 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-17 01:33:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:33:22,623 INFO L93 Difference]: Finished difference Result 316 states and 494 transitions. [2025-03-17 01:33:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:33:22,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 255 [2025-03-17 01:33:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:33:22,626 INFO L225 Difference]: With dead ends: 316 [2025-03-17 01:33:22,626 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 01:33:22,627 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-17 01:33:22,628 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 97 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:33:22,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 428 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:33:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 01:33:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2025-03-17 01:33:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 111 states have internal predecessors, (143), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 01:33:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 311 transitions. [2025-03-17 01:33:22,678 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 311 transitions. Word has length 255 [2025-03-17 01:33:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:33:22,679 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 311 transitions. [2025-03-17 01:33:22,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-17 01:33:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 311 transitions. [2025-03-17 01:33:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-17 01:33:22,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:33:22,682 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:33:22,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:33:22,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:33:22,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:33:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1516522626, now seen corresponding path program 1 times [2025-03-17 01:33:22,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:33:22,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860153964] [2025-03-17 01:33:22,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:33:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-17 01:33:22,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-17 01:33:22,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:22,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-17 01:33:22,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:33:22,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860153964] [2025-03-17 01:33:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860153964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:33:22,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:33:22,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:33:22,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968566414] [2025-03-17 01:33:22,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:33:22,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:33:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:33:22,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:33:22,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:33:22,973 INFO L87 Difference]: Start difference. First operand 198 states and 311 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-17 01:33:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:33:23,223 INFO L93 Difference]: Finished difference Result 334 states and 519 transitions. [2025-03-17 01:33:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:33:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 256 [2025-03-17 01:33:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:33:23,228 INFO L225 Difference]: With dead ends: 334 [2025-03-17 01:33:23,229 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 01:33:23,229 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-17 01:33:23,232 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 94 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:33:23,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 431 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:33:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 01:33:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 199. [2025-03-17 01:33:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 112 states have internal predecessors, (143), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 01:33:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 311 transitions. [2025-03-17 01:33:23,265 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 311 transitions. Word has length 256 [2025-03-17 01:33:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:33:23,267 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 311 transitions. [2025-03-17 01:33:23,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-17 01:33:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 311 transitions. [2025-03-17 01:33:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-17 01:33:23,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:33:23,269 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:33:23,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:33:23,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:33:23,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:33:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1841905086, now seen corresponding path program 1 times [2025-03-17 01:33:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:33:23,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725915495] [2025-03-17 01:33:23,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:33:23,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-17 01:33:23,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-17 01:33:23,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-17 01:33:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:33:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725915495] [2025-03-17 01:33:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725915495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:33:29,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:33:29,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:33:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930210083] [2025-03-17 01:33:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:33:29,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:33:29,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:33:29,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:33:29,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:33:29,155 INFO L87 Difference]: Start difference. First operand 199 states and 311 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-17 01:33:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:33:31,518 INFO L93 Difference]: Finished difference Result 546 states and 829 transitions. [2025-03-17 01:33:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:33:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 257 [2025-03-17 01:33:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:33:31,521 INFO L225 Difference]: With dead ends: 546 [2025-03-17 01:33:31,521 INFO L226 Difference]: Without dead ends: 443 [2025-03-17 01:33:31,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:33:31,522 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 413 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:33:31,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1406 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 01:33:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-17 01:33:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 368. [2025-03-17 01:33:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 237 states have (on average 1.3333333333333333) internal successors, (316), 237 states have internal predecessors, (316), 126 states have call successors, (126), 4 states have call predecessors, (126), 4 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 01:33:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 568 transitions. [2025-03-17 01:33:31,565 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 568 transitions. Word has length 257 [2025-03-17 01:33:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:33:31,566 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 568 transitions. [2025-03-17 01:33:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-17 01:33:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 568 transitions. [2025-03-17 01:33:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-17 01:33:31,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:33:31,569 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:33:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:33:31,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:33:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:33:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1942528033, now seen corresponding path program 1 times [2025-03-17 01:33:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:33:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369348458] [2025-03-17 01:33:31,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:33:31,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-17 01:33:31,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-17 01:33:31,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:31,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-17 01:33:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:33:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369348458] [2025-03-17 01:33:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369348458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:33:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044881897] [2025-03-17 01:33:31,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:33:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:33:31,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:33:31,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:33:31,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-17 01:33:31,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-17 01:33:31,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:31,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:31,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:33:31,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:33:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1491 proven. 36 refuted. 0 times theorem prover too weak. 1917 trivial. 0 not checked. [2025-03-17 01:33:32,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:33:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-17 01:33:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044881897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:33:32,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:33:32,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 01:33:32,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419595416] [2025-03-17 01:33:32,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:33:32,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:33:32,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:33:32,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:33:32,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:33:32,349 INFO L87 Difference]: Start difference. First operand 368 states and 568 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-17 01:33:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:33:32,556 INFO L93 Difference]: Finished difference Result 643 states and 973 transitions. [2025-03-17 01:33:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:33:32,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 257 [2025-03-17 01:33:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:33:32,559 INFO L225 Difference]: With dead ends: 643 [2025-03-17 01:33:32,559 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 01:33:32,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:33:32,561 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 81 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:33:32,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 253 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:33:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 01:33:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 380. [2025-03-17 01:33:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 246 states have (on average 1.2926829268292683) internal successors, (318), 246 states have internal predecessors, (318), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 01:33:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 570 transitions. [2025-03-17 01:33:32,593 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 570 transitions. Word has length 257 [2025-03-17 01:33:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:33:32,594 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 570 transitions. [2025-03-17 01:33:32,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-17 01:33:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 570 transitions. [2025-03-17 01:33:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-17 01:33:32,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:33:32,596 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:33:32,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:33:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:33:32,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:33:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:33:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1485214875, now seen corresponding path program 1 times [2025-03-17 01:33:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:33:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588690332] [2025-03-17 01:33:32,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:33:32,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-17 01:33:32,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 01:33:32,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:32,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-17 01:33:36,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:33:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588690332] [2025-03-17 01:33:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588690332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:33:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264808058] [2025-03-17 01:33:36,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:33:36,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:33:36,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:33:36,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:33:36,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:33:36,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-17 01:33:36,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 01:33:36,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:33:36,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:33:36,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 01:33:36,693 INFO L279 TraceCheckSpWp]: Computing forward predicates...