./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-61.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-co_file-61.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 97692fb21d2590ddfd299a53a26dc32a54ce91956799a82db26e93434d82409c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:48:17,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:48:17,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:48:17,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:48:17,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:48:17,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:48:17,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:48:17,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:48:17,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:48:17,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:48:17,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:48:17,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:48:17,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:48:17,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:48:17,731 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:48:17,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:48:17,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:48:17,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:48:17,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:48:17,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:48:17,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:48:17,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:48:17,734 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 -> 97692fb21d2590ddfd299a53a26dc32a54ce91956799a82db26e93434d82409c [2025-03-17 01:48:17,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:48:17,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:48:17,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:48:17,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:48:17,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:48:17,955 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-co_file-61.i [2025-03-17 01:48:19,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aced4f30c/dace38c2db39415ba455644155575a22/FLAG13353e8ef [2025-03-17 01:48:19,353 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:48:19,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-61.i [2025-03-17 01:48:19,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aced4f30c/dace38c2db39415ba455644155575a22/FLAG13353e8ef [2025-03-17 01:48:19,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aced4f30c/dace38c2db39415ba455644155575a22 [2025-03-17 01:48:19,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:48:19,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:48:19,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:48:19,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:48:19,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:48:19,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:19,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffbba88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19, skipping insertion in model container [2025-03-17 01:48:19,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:19,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:48:19,808 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-co_file-61.i[919,932] [2025-03-17 01:48:19,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:48:19,898 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:48:19,907 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-co_file-61.i[919,932] [2025-03-17 01:48:19,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:48:19,956 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:48:19,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19 WrapperNode [2025-03-17 01:48:19,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:48:19,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:48:19,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:48:19,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:48:19,961 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:48:19" (1/1) ... [2025-03-17 01:48:19,971 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:48:19" (1/1) ... [2025-03-17 01:48:19,992 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2025-03-17 01:48:19,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:48:19,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:48:19,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:48:19,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:48:20,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,020 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:48:20,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:48:20,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:48:20,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:48:20,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:48:20,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (1/1) ... [2025-03-17 01:48:20,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:48:20,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:20,070 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:48:20,074 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:48:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:48:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:48:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:48:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:48:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:48:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:48:20,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:48:20,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:48:20,456 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: havoc property_#t~ite29#1;havoc property_#t~ite28#1;havoc property_#t~bitwise27#1;havoc property_#t~short30#1; [2025-03-17 01:48:20,489 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 01:48:20,491 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:48:20,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:48:20,506 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:48:20,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:20 BoogieIcfgContainer [2025-03-17 01:48:20,506 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:48:20,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:48:20,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:48:20,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:48:20,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:48:19" (1/3) ... [2025-03-17 01:48:20,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785a6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:20, skipping insertion in model container [2025-03-17 01:48:20,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:19" (2/3) ... [2025-03-17 01:48:20,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785a6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:20, skipping insertion in model container [2025-03-17 01:48:20,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:20" (3/3) ... [2025-03-17 01:48:20,513 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-61.i [2025-03-17 01:48:20,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:48:20,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-61.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:48:20,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:48:20,569 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;@5a646123, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:48:20,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:48:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 80 states have internal predecessors, (116), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:48:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:20,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:20,587 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:20,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1579266322, now seen corresponding path program 1 times [2025-03-17 01:48:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039257725] [2025-03-17 01:48:20,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:20,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:20,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:20,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:20,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 01:48:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039257725] [2025-03-17 01:48:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039257725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:48:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730880166] [2025-03-17 01:48:20,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:20,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:20,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:20,959 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:48:20,960 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:48:21,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:21,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:21,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:21,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:21,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:48:21,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:48:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-17 01:48:21,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:48:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730880166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:48:21,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:48:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862120935] [2025-03-17 01:48:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:21,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:48:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:21,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:48:21,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:48:21,206 INFO L87 Difference]: Start difference. First operand has 122 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 80 states have internal predecessors, (116), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 01:48:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:21,242 INFO L93 Difference]: Finished difference Result 241 states and 430 transitions. [2025-03-17 01:48:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:48:21,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 251 [2025-03-17 01:48:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:21,250 INFO L225 Difference]: With dead ends: 241 [2025-03-17 01:48:21,250 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 01:48:21,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 252 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:48:21,256 INFO L435 NwaCegarLoop]: 187 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, 187 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-17 01:48:21,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 01:48:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 01:48:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:48:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 190 transitions. [2025-03-17 01:48:21,296 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 190 transitions. Word has length 251 [2025-03-17 01:48:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 190 transitions. [2025-03-17 01:48:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-17 01:48:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 190 transitions. [2025-03-17 01:48:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:21,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:21,302 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:21,309 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:48:21,505 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:48:21,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:21,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2115224756, now seen corresponding path program 1 times [2025-03-17 01:48:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:21,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001298931] [2025-03-17 01:48:21,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:21,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:21,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:21,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:21,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:21,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:48:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001298931] [2025-03-17 01:48:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001298931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:48:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407858861] [2025-03-17 01:48:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:48:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:21,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:48:21,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:21,796 INFO L87 Difference]: Start difference. First operand 120 states and 190 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:21,835 INFO L93 Difference]: Finished difference Result 239 states and 379 transitions. [2025-03-17 01:48:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:48:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2025-03-17 01:48:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:21,837 INFO L225 Difference]: With dead ends: 239 [2025-03-17 01:48:21,840 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 01:48:21,841 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-17 01:48:21,841 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:21,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 01:48:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 01:48:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:48:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 189 transitions. [2025-03-17 01:48:21,861 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 189 transitions. Word has length 251 [2025-03-17 01:48:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:21,863 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 189 transitions. [2025-03-17 01:48:21,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 189 transitions. [2025-03-17 01:48:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:21,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:21,868 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:48:21,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1925005995, now seen corresponding path program 1 times [2025-03-17 01:48:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966373807] [2025-03-17 01:48:21,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:21,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:21,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:21,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:48:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966373807] [2025-03-17 01:48:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966373807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:48:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535013076] [2025-03-17 01:48:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:22,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:48:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:22,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:48:22,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:22,118 INFO L87 Difference]: Start difference. First operand 120 states and 189 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:22,205 INFO L93 Difference]: Finished difference Result 341 states and 537 transitions. [2025-03-17 01:48:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:48:22,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2025-03-17 01:48:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:22,209 INFO L225 Difference]: With dead ends: 341 [2025-03-17 01:48:22,209 INFO L226 Difference]: Without dead ends: 222 [2025-03-17 01:48:22,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 01:48:22,213 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 163 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 380 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:48:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-17 01:48:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 145. [2025-03-17 01:48:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 103 states have internal predecessors, (151), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:48:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 231 transitions. [2025-03-17 01:48:22,237 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 231 transitions. Word has length 251 [2025-03-17 01:48:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:22,237 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 231 transitions. [2025-03-17 01:48:22,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2025-03-17 01:48:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:22,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:22,240 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:48:22,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:22,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1080534124, now seen corresponding path program 1 times [2025-03-17 01:48:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:22,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886590398] [2025-03-17 01:48:22,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:22,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:48:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886590398] [2025-03-17 01:48:22,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886590398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:48:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201305195] [2025-03-17 01:48:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:22,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:48:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:22,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:48:22,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:22,644 INFO L87 Difference]: Start difference. First operand 145 states and 231 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:22,693 INFO L93 Difference]: Finished difference Result 433 states and 691 transitions. [2025-03-17 01:48:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:48:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2025-03-17 01:48:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:22,699 INFO L225 Difference]: With dead ends: 433 [2025-03-17 01:48:22,700 INFO L226 Difference]: Without dead ends: 289 [2025-03-17 01:48:22,701 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-17 01:48:22,701 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 105 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:22,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 384 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-17 01:48:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2025-03-17 01:48:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 202 states have (on average 1.4554455445544554) internal successors, (294), 202 states have internal predecessors, (294), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:48:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 454 transitions. [2025-03-17 01:48:22,755 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 454 transitions. Word has length 251 [2025-03-17 01:48:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 454 transitions. [2025-03-17 01:48:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 454 transitions. [2025-03-17 01:48:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:22,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:22,758 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:48:22,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:22,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -716417235, now seen corresponding path program 1 times [2025-03-17 01:48:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785813538] [2025-03-17 01:48:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:22,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:22,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:22,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:22,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:48:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785813538] [2025-03-17 01:48:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785813538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:23,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:48:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076937609] [2025-03-17 01:48:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:48:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:23,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:48:23,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:48:23,094 INFO L87 Difference]: Start difference. First operand 285 states and 454 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:23,290 INFO L93 Difference]: Finished difference Result 569 states and 907 transitions. [2025-03-17 01:48:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:48:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2025-03-17 01:48:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:23,293 INFO L225 Difference]: With dead ends: 569 [2025-03-17 01:48:23,293 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 01:48:23,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:48:23,295 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 119 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:23,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 269 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:48:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 01:48:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-17 01:48:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:48:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 452 transitions. [2025-03-17 01:48:23,329 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 452 transitions. Word has length 251 [2025-03-17 01:48:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:23,329 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 452 transitions. [2025-03-17 01:48:23,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 452 transitions. [2025-03-17 01:48:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:23,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:23,333 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:48:23,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -505066322, now seen corresponding path program 1 times [2025-03-17 01:48:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-03-17 01:48:23,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:23,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:23,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:23,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:23,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-17 01:48:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-03-17 01:48:23,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817061164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:23,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:48:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955694021] [2025-03-17 01:48:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:23,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:48:23,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:23,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:48:23,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:48:23,639 INFO L87 Difference]: Start difference. First operand 285 states and 452 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:24,172 INFO L93 Difference]: Finished difference Result 802 states and 1265 transitions. [2025-03-17 01:48:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:48:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2025-03-17 01:48:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:24,177 INFO L225 Difference]: With dead ends: 802 [2025-03-17 01:48:24,177 INFO L226 Difference]: Without dead ends: 518 [2025-03-17 01:48:24,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:48:24,179 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 334 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:24,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 395 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:48:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-17 01:48:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 360. [2025-03-17 01:48:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 277 states have (on average 1.483754512635379) internal successors, (411), 277 states have internal predecessors, (411), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:48:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 571 transitions. [2025-03-17 01:48:24,243 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 571 transitions. Word has length 251 [2025-03-17 01:48:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:24,243 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 571 transitions. [2025-03-17 01:48:24,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-17 01:48:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 571 transitions. [2025-03-17 01:48:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 01:48:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:24,247 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:48:24,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash -572073075, now seen corresponding path program 1 times [2025-03-17 01:48:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:24,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168869760] [2025-03-17 01:48:24,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:24,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 01:48:24,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 01:48:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat