./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-co_file-66.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 e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:06:46,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:06:47,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:06:47,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:06:47,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:06:47,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:06:47,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:06:47,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:06:47,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:06:47,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:06:47,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:06:47,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:06:47,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:06:47,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:06:47,065 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:06:47,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:06:47,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:06:47,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:06:47,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:06:47,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:06:47,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:06:47,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:06:47,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:06:47,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:06:47,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:06:47,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:06:47,068 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 -> e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 [2025-03-08 12:06:47,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:06:47,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:06:47,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:06:47,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:06:47,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:06:47,333 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-co_file-66.i [2025-03-08 12:06:48,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfeaab4c2/f0f4316bcad242cd927401869bfaee09/FLAGb28a3c063 [2025-03-08 12:06:48,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:06:48,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-03-08 12:06:48,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfeaab4c2/f0f4316bcad242cd927401869bfaee09/FLAGb28a3c063 [2025-03-08 12:06:49,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfeaab4c2/f0f4316bcad242cd927401869bfaee09 [2025-03-08 12:06:49,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:06:49,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:06:49,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:06:49,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:06:49,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:06:49,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bdbc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49, skipping insertion in model container [2025-03-08 12:06:49,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:06:49,222 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-co_file-66.i[919,932] [2025-03-08 12:06:49,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:06:49,315 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:06:49,324 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-co_file-66.i[919,932] [2025-03-08 12:06:49,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:06:49,384 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:06:49,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49 WrapperNode [2025-03-08 12:06:49,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:06:49,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:06:49,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:06:49,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:06:49,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,428 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-08 12:06:49,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:06:49,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:06:49,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:06:49,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:06:49,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,452 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-08 12:06:49,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:06:49,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:06:49,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:06:49,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:06:49,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (1/1) ... [2025-03-08 12:06:49,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:06:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:06:49,498 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-08 12:06:49,501 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-08 12:06:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:06:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:06:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:06:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:06:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:06:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:06:49,590 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:06:49,592 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:06:49,916 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:06:49,916 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:06:49,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:06:49,932 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:06:49,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:06:49 BoogieIcfgContainer [2025-03-08 12:06:49,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:06:49,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:06:49,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:06:49,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:06:49,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:06:49" (1/3) ... [2025-03-08 12:06:49,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81eb7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:06:49, skipping insertion in model container [2025-03-08 12:06:49,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:06:49" (2/3) ... [2025-03-08 12:06:49,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81eb7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:06:49, skipping insertion in model container [2025-03-08 12:06:49,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:06:49" (3/3) ... [2025-03-08 12:06:49,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-03-08 12:06:49,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:06:49,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:06:49,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:06:50,001 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;@58c8611f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:06:50,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:06:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 12:06:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:06:50,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:06:50,015 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:06:50,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:06:50,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:06:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2073534347, now seen corresponding path program 1 times [2025-03-08 12:06:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:06:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412948979] [2025-03-08 12:06:50,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:06:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:06:50,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:06:50,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:06:50,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:06:50,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:06:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 12:06:50,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:06:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412948979] [2025-03-08 12:06:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412948979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:06:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95176372] [2025-03-08 12:06:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:06:50,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:06:50,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:06:50,295 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-08 12:06:50,297 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-08 12:06:50,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:06:50,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:06:50,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:06:50,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:06:50,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:06:50,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:06:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 12:06:50,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:06:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95176372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:06:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:06:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:06:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648597017] [2025-03-08 12:06:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:06:50,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:06:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:06:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:06:50,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:06:50,527 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 12:06:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:06:50,554 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2025-03-08 12:06:50,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:06:50,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-03-08 12:06:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:06:50,561 INFO L225 Difference]: With dead ends: 160 [2025-03-08 12:06:50,561 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 12:06:50,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-08 12:06:50,565 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:06:50,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:06:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 12:06:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 12:06:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 12:06:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2025-03-08 12:06:50,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 160 [2025-03-08 12:06:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:06:50,602 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2025-03-08 12:06:50,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 12:06:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2025-03-08 12:06:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:06:50,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:06:50,606 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:06:50,614 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-08 12:06:50,807 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-08 12:06:50,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:06:50,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:06:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2018364115, now seen corresponding path program 1 times [2025-03-08 12:06:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:06:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209779595] [2025-03-08 12:06:50,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:06:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:06:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:06:50,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:06:50,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:06:50,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:06:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:06:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:06:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209779595] [2025-03-08 12:06:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209779595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:06:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:06:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:06:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700806846] [2025-03-08 12:06:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:06:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:06:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:06:51,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:06:51,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:06:51,112 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 12:06:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:06:51,316 INFO L93 Difference]: Finished difference Result 234 states and 372 transitions. [2025-03-08 12:06:51,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:06:51,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-03-08 12:06:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:06:51,320 INFO L225 Difference]: With dead ends: 234 [2025-03-08 12:06:51,322 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 12:06:51,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 12:06:51,324 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 203 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:06:51,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 216 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:06:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 12:06:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-03-08 12:06:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 12:06:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2025-03-08 12:06:51,357 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 160 [2025-03-08 12:06:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:06:51,358 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2025-03-08 12:06:51,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 12:06:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2025-03-08 12:06:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:06:51,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:06:51,360 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:06:51,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:06:51,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:06:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:06:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 210909652, now seen corresponding path program 1 times [2025-03-08 12:06:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:06:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687934493] [2025-03-08 12:06:51,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:06:51,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:06:51,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:06:51,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:06:51,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:06:51,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:07:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687934493] [2025-03-08 12:07:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687934493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:07:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657738360] [2025-03-08 12:07:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:07:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:14,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:07:14,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:07:14,138 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:07:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:15,544 INFO L93 Difference]: Finished difference Result 669 states and 1062 transitions. [2025-03-08 12:07:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:07:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-08 12:07:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:15,549 INFO L225 Difference]: With dead ends: 669 [2025-03-08 12:07:15,549 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 12:07:15,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:07:15,554 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 582 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:15,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 515 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:07:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 12:07:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 315. [2025-03-08 12:07:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 254 states have (on average 1.5236220472440944) internal successors, (387), 256 states have internal predecessors, (387), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 12:07:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 499 transitions. [2025-03-08 12:07:15,587 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 499 transitions. Word has length 160 [2025-03-08 12:07:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:15,588 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 499 transitions. [2025-03-08 12:07:15,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:07:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 499 transitions. [2025-03-08 12:07:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:07:15,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:15,593 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:15,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:07:15,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 339992371, now seen corresponding path program 1 times [2025-03-08 12:07:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825621451] [2025-03-08 12:07:15,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:15,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:07:15,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:07:15,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:15,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:07:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:29,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825621451] [2025-03-08 12:07:29,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825621451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:29,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:29,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 12:07:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146132174] [2025-03-08 12:07:29,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:29,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 12:07:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:29,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 12:07:29,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:07:29,710 INFO L87 Difference]: Start difference. First operand 315 states and 499 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-08 12:07:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:40,916 INFO L93 Difference]: Finished difference Result 805 states and 1232 transitions. [2025-03-08 12:07:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 12:07:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 160 [2025-03-08 12:07:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:40,920 INFO L225 Difference]: With dead ends: 805 [2025-03-08 12:07:40,920 INFO L226 Difference]: Without dead ends: 493 [2025-03-08 12:07:40,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 12:07:40,921 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 741 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:40,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 654 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 12:07:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-08 12:07:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 335. [2025-03-08 12:07:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 268 states have (on average 1.492537313432836) internal successors, (400), 270 states have internal predecessors, (400), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:07:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 520 transitions. [2025-03-08 12:07:40,968 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 520 transitions. Word has length 160 [2025-03-08 12:07:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:40,969 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 520 transitions. [2025-03-08 12:07:40,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-08 12:07:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 520 transitions. [2025-03-08 12:07:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:07:40,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:40,971 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:40,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:07:40,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash 721443829, now seen corresponding path program 1 times [2025-03-08 12:07:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958166802] [2025-03-08 12:07:40,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:07:41,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:07:41,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:41,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:07:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:07:55,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:07:55,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958166802] [2025-03-08 12:07:55,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958166802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:07:55,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:07:55,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:07:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434009383] [2025-03-08 12:07:55,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:07:55,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:07:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:07:55,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:07:55,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:07:55,363 INFO L87 Difference]: Start difference. First operand 335 states and 520 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:07:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:07:56,996 INFO L93 Difference]: Finished difference Result 475 states and 717 transitions. [2025-03-08 12:07:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:07:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-08 12:07:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:07:57,001 INFO L225 Difference]: With dead ends: 475 [2025-03-08 12:07:57,001 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 12:07:57,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:07:57,002 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 217 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:07:57,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 776 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 12:07:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 12:07:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 339. [2025-03-08 12:07:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 272 states have (on average 1.4926470588235294) internal successors, (406), 274 states have internal predecessors, (406), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:07:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 526 transitions. [2025-03-08 12:07:57,029 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 526 transitions. Word has length 160 [2025-03-08 12:07:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:07:57,030 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 526 transitions. [2025-03-08 12:07:57,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:07:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 526 transitions. [2025-03-08 12:07:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:07:57,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:07:57,031 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:07:57,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:07:57,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:07:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:07:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 850526548, now seen corresponding path program 1 times [2025-03-08 12:07:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:07:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479816184] [2025-03-08 12:07:57,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:07:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:07:57,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:07:57,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:07:57,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:07:57,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:08:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:08:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479816184] [2025-03-08 12:08:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479816184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:00,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:08:00,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:08:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177343289] [2025-03-08 12:08:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:00,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:08:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:08:00,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:08:00,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:08:00,426 INFO L87 Difference]: Start difference. First operand 339 states and 526 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:08:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:02,723 INFO L93 Difference]: Finished difference Result 472 states and 712 transitions. [2025-03-08 12:08:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:08:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-08 12:08:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:02,726 INFO L225 Difference]: With dead ends: 472 [2025-03-08 12:08:02,726 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 12:08:02,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:08:02,727 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 448 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:02,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 649 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 12:08:02,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 12:08:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 339. [2025-03-08 12:08:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 272 states have (on average 1.4926470588235294) internal successors, (406), 274 states have internal predecessors, (406), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 12:08:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 526 transitions. [2025-03-08 12:08:02,753 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 526 transitions. Word has length 160 [2025-03-08 12:08:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:02,754 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 526 transitions. [2025-03-08 12:08:02,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:08:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 526 transitions. [2025-03-08 12:08:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:08:02,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:02,755 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:02,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:08:02,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:02,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -633562219, now seen corresponding path program 1 times [2025-03-08 12:08:02,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:08:02,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134308014] [2025-03-08 12:08:02,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:08:02,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:08:02,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:08:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:08:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:08:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134308014] [2025-03-08 12:08:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134308014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:08:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:08:02,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755389492] [2025-03-08 12:08:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:02,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:08:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:08:02,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:08:02,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:08:02,796 INFO L87 Difference]: Start difference. First operand 339 states and 526 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:08:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:02,851 INFO L93 Difference]: Finished difference Result 869 states and 1339 transitions. [2025-03-08 12:08:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:08:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-08 12:08:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:02,855 INFO L225 Difference]: With dead ends: 869 [2025-03-08 12:08:02,855 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 12:08:02,856 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-08 12:08:02,857 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 109 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:02,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 330 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:08:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 12:08:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 527. [2025-03-08 12:08:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 394 states have (on average 1.383248730964467) internal successors, (545), 398 states have internal predecessors, (545), 120 states have call successors, (120), 12 states have call predecessors, (120), 12 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 12:08:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 785 transitions. [2025-03-08 12:08:02,899 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 785 transitions. Word has length 160 [2025-03-08 12:08:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 785 transitions. [2025-03-08 12:08:02,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:08:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 785 transitions. [2025-03-08 12:08:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:08:02,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:02,901 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:02,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:08:02,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 873989590, now seen corresponding path program 1 times [2025-03-08 12:08:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:08:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739994639] [2025-03-08 12:08:02,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:08:02,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:08:02,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:08:02,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:08:08,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:08:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739994639] [2025-03-08 12:08:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739994639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:08:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 12:08:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684493747] [2025-03-08 12:08:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:08:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:08:08,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:08:08,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:08:08,321 INFO L87 Difference]: Start difference. First operand 527 states and 785 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 12:08:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:10,059 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2025-03-08 12:08:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:08:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-03-08 12:08:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:10,068 INFO L225 Difference]: With dead ends: 1340 [2025-03-08 12:08:10,068 INFO L226 Difference]: Without dead ends: 816 [2025-03-08 12:08:10,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 12:08:10,072 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 854 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:10,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 891 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:08:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-08 12:08:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 719. [2025-03-08 12:08:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 528 states have (on average 1.356060606060606) internal successors, (716), 533 states have internal predecessors, (716), 170 states have call successors, (170), 20 states have call predecessors, (170), 20 states have return successors, (170), 165 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-08 12:08:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1056 transitions. [2025-03-08 12:08:10,137 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1056 transitions. Word has length 160 [2025-03-08 12:08:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:10,138 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1056 transitions. [2025-03-08 12:08:10,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 12:08:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1056 transitions. [2025-03-08 12:08:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:08:10,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:10,140 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:10,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:08:10,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1384523767, now seen corresponding path program 1 times [2025-03-08 12:08:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:08:10,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007800752] [2025-03-08 12:08:10,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:08:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:08:10,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:08:10,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:10,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 12:08:10,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:08:10,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007800752] [2025-03-08 12:08:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007800752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:08:10,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:08:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:08:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417325486] [2025-03-08 12:08:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:08:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:08:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:08:10,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:08:10,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:08:10,219 INFO L87 Difference]: Start difference. First operand 719 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:08:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:08:10,442 INFO L93 Difference]: Finished difference Result 1446 states and 2116 transitions. [2025-03-08 12:08:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:08:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-08 12:08:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:08:10,447 INFO L225 Difference]: With dead ends: 1446 [2025-03-08 12:08:10,447 INFO L226 Difference]: Without dead ends: 789 [2025-03-08 12:08:10,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:08:10,449 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 107 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:08:10,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 440 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:08:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-08 12:08:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 721. [2025-03-08 12:08:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 530 states have (on average 1.3547169811320754) internal successors, (718), 535 states have internal predecessors, (718), 170 states have call successors, (170), 20 states have call predecessors, (170), 20 states have return successors, (170), 165 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-08 12:08:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1058 transitions. [2025-03-08 12:08:10,508 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1058 transitions. Word has length 160 [2025-03-08 12:08:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:08:10,509 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1058 transitions. [2025-03-08 12:08:10,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 12:08:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1058 transitions. [2025-03-08 12:08:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:08:10,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:08:10,511 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:08:10,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:08:10,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:08:10,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:08:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1034358615, now seen corresponding path program 1 times [2025-03-08 12:08:10,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:08:10,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115037373] [2025-03-08 12:08:10,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:10,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:08:10,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:08:10,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:08:10,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:10,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-03-08 12:08:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:08:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115037373] [2025-03-08 12:08:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115037373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:08:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932088507] [2025-03-08 12:08:13,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:08:13,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:08:13,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:08:13,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:08:13,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:08:13,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:08:13,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:08:13,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:08:13,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:08:13,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 12:08:13,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:08:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 576 proven. 276 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 12:08:15,863 INFO L312 TraceCheckSpWp]: Computing backward predicates...