./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.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 ff0278513429ffc22c784418884e09a92254749accfdc90a0be2595788a173c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:43:26,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:43:26,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:43:26,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:43:26,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:43:26,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:43:26,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:43:26,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:43:26,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:43:26,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:43:26,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:43:26,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:43:26,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:43:26,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:43:26,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:26,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:43:26,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:43:26,144 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 -> ff0278513429ffc22c784418884e09a92254749accfdc90a0be2595788a173c1 [2025-03-03 20:43:26,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:43:26,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:43:26,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:43:26,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:43:26,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:43:26,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i [2025-03-03 20:43:27,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883b79ef/bd024bd645444ee69f2f9c253956d71c/FLAG30aae714b [2025-03-03 20:43:27,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:43:27,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i [2025-03-03 20:43:27,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883b79ef/bd024bd645444ee69f2f9c253956d71c/FLAG30aae714b [2025-03-03 20:43:27,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883b79ef/bd024bd645444ee69f2f9c253956d71c [2025-03-03 20:43:27,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:43:27,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:43:27,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:27,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:43:27,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:43:27,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:27" (1/1) ... [2025-03-03 20:43:27,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:27, skipping insertion in model container [2025-03-03 20:43:27,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:27" (1/1) ... [2025-03-03 20:43:27,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:43:27,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i[919,932] [2025-03-03 20:43:28,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:28,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:43:28,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i[919,932] [2025-03-03 20:43:28,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:28,133 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:43:28,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28 WrapperNode [2025-03-03 20:43:28,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:28,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:28,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:43:28,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:43:28,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,187 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-03-03 20:43:28,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:28,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:43:28,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:43:28,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:43:28,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,227 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:43:28,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:43:28,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:43:28,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:43:28,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:43:28,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (1/1) ... [2025-03-03 20:43:28,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:28,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:43:28,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:43:28,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:43:28,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:43:28,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:43:28,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:43:28,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:43:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:43:28,379 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:43:28,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:43:28,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-03 20:43:28,765 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:43:28,765 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:43:28,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:43:28,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:43:28,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:28 BoogieIcfgContainer [2025-03-03 20:43:28,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:43:28,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:43:28,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:43:28,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:43:28,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:43:27" (1/3) ... [2025-03-03 20:43:28,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418932c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:28, skipping insertion in model container [2025-03-03 20:43:28,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:28" (2/3) ... [2025-03-03 20:43:28,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418932c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:28, skipping insertion in model container [2025-03-03 20:43:28,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:28" (3/3) ... [2025-03-03 20:43:28,792 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i [2025-03-03 20:43:28,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:43:28,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-64.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:43:28,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:43:28,868 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;@11d6c962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:43:28,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:43:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 68 states have internal predecessors, (91), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 20:43:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 20:43:28,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:28,889 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:28,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1709360191, now seen corresponding path program 1 times [2025-03-03 20:43:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:28,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832595843] [2025-03-03 20:43:28,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:28,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 20:43:29,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 20:43:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-03 20:43:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:29,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832595843] [2025-03-03 20:43:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832595843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:43:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949458797] [2025-03-03 20:43:29,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:29,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:43:29,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:29,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:43:29,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:43:29,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 20:43:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 20:43:29,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:29,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:29,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:43:29,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:43:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-03 20:43:29,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:43:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949458797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:43:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:43:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191229399] [2025-03-03 20:43:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:29,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:43:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:29,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:43:29,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:29,576 INFO L87 Difference]: Start difference. First operand has 116 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 68 states have internal predecessors, (91), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 20:43:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:29,608 INFO L93 Difference]: Finished difference Result 226 states and 407 transitions. [2025-03-03 20:43:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:43:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 282 [2025-03-03 20:43:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:29,615 INFO L225 Difference]: With dead ends: 226 [2025-03-03 20:43:29,615 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 20:43:29,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:29,621 INFO L435 NwaCegarLoop]: 176 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, 176 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-03 20:43:29,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 20:43:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 20:43:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 20:43:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2025-03-03 20:43:29,658 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 282 [2025-03-03 20:43:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:29,660 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2025-03-03 20:43:29,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 20:43:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2025-03-03 20:43:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 20:43:29,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:29,667 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:29,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:43:29,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:43:29,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 800244739, now seen corresponding path program 1 times [2025-03-03 20:43:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-03 20:43:29,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:29,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 20:43:29,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 20:43:29,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:29,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 20:43:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-03 20:43:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386743495] [2025-03-03 20:43:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:30,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:30,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:30,513 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:30,874 INFO L93 Difference]: Finished difference Result 353 states and 555 transitions. [2025-03-03 20:43:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 20:43:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:30,877 INFO L225 Difference]: With dead ends: 353 [2025-03-03 20:43:30,880 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 20:43:30,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 20:43:30,882 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 210 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:30,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 810 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:43:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 20:43:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 128. [2025-03-03 20:43:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 20:43:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2025-03-03 20:43:30,907 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 282 [2025-03-03 20:43:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:30,911 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2025-03-03 20:43:30,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2025-03-03 20:43:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 20:43:30,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:30,916 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:30,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:43:30,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash 289710562, now seen corresponding path program 1 times [2025-03-03 20:43:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862161287] [2025-03-03 20:43:30,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:30,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 20:43:30,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 20:43:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 20:43:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:34,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862161287] [2025-03-03 20:43:34,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862161287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:34,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:34,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:34,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577863901] [2025-03-03 20:43:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:34,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:34,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:34,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:34,554 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:34,878 INFO L93 Difference]: Finished difference Result 363 states and 571 transitions. [2025-03-03 20:43:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 20:43:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:34,885 INFO L225 Difference]: With dead ends: 363 [2025-03-03 20:43:34,885 INFO L226 Difference]: Without dead ends: 238 [2025-03-03 20:43:34,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:43:34,886 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 202 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:34,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 832 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:43:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-03 20:43:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 128. [2025-03-03 20:43:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 20:43:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2025-03-03 20:43:34,904 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 282 [2025-03-03 20:43:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:34,904 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2025-03-03 20:43:34,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2025-03-03 20:43:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 20:43:34,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:34,906 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:34,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:43:34,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:34,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:34,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1132486082, now seen corresponding path program 1 times [2025-03-03 20:43:34,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:34,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247066310] [2025-03-03 20:43:34,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:34,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 20:43:34,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 20:43:34,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:34,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 20:43:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247066310] [2025-03-03 20:43:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247066310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:35,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287854478] [2025-03-03 20:43:35,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:35,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:35,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:35,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:35,168 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:35,387 INFO L93 Difference]: Finished difference Result 443 states and 699 transitions. [2025-03-03 20:43:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 20:43:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:35,392 INFO L225 Difference]: With dead ends: 443 [2025-03-03 20:43:35,392 INFO L226 Difference]: Without dead ends: 318 [2025-03-03 20:43:35,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 20:43:35,395 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 332 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:35,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 847 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-03 20:43:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 128. [2025-03-03 20:43:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 20:43:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2025-03-03 20:43:35,417 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 282 [2025-03-03 20:43:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:35,418 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2025-03-03 20:43:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2025-03-03 20:43:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 20:43:35,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:35,420 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:35,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:43:35,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:35,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 621951905, now seen corresponding path program 1 times [2025-03-03 20:43:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235187781] [2025-03-03 20:43:35,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:35,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 20:43:35,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 20:43:35,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:35,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 20:43:35,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235187781] [2025-03-03 20:43:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235187781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:43:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938783025] [2025-03-03 20:43:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:35,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:43:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:35,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:43:35,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:43:35,679 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:35,887 INFO L93 Difference]: Finished difference Result 443 states and 698 transitions. [2025-03-03 20:43:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:43:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 20:43:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:35,890 INFO L225 Difference]: With dead ends: 443 [2025-03-03 20:43:35,890 INFO L226 Difference]: Without dead ends: 318 [2025-03-03 20:43:35,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 20:43:35,891 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 311 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:35,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 906 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:43:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-03 20:43:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 113. [2025-03-03 20:43:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 20:43:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2025-03-03 20:43:35,907 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 177 transitions. Word has length 282 [2025-03-03 20:43:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:35,910 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 177 transitions. [2025-03-03 20:43:35,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 20:43:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 177 transitions. [2025-03-03 20:43:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 20:43:35,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:35,912 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:43:35,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:43:35,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:35,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash -590351039, now seen corresponding path program 1 times [2025-03-03 20:43:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447309635] [2025-03-03 20:43:35,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:35,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 20:43:36,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 20:43:36,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:36,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat