./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d964adfd28c767eded8fdfbce722a54e84eb80fd1e317a796a69a672aa367725 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:02:52,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:02:52,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:02:52,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:02:52,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:02:52,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:02:52,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:02:52,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:02:52,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:02:52,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:02:52,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:02:52,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:02:52,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:02:52,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:02:52,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:02:52,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:02:52,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:02:52,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:02:52,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:02:52,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:02:52,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:02:52,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:02:52,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:02:52,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:02:52,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:02:52,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:02:52,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:02:52,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:02:52,782 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 -> d964adfd28c767eded8fdfbce722a54e84eb80fd1e317a796a69a672aa367725 [2025-03-03 21:02:52,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:02:52,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:02:52,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:02:52,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:02:52,987 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:02:52,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2025-03-03 21:02:54,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa4878eb9/a15f5505811649318a53c0561187b3ee/FLAGce4e93748 [2025-03-03 21:02:54,323 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:02:54,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2025-03-03 21:02:54,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa4878eb9/a15f5505811649318a53c0561187b3ee/FLAGce4e93748 [2025-03-03 21:02:54,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa4878eb9/a15f5505811649318a53c0561187b3ee [2025-03-03 21:02:54,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:02:54,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:02:54,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:02:54,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:02:54,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:02:54,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3ad7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54, skipping insertion in model container [2025-03-03 21:02:54,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:02:54,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i[919,932] [2025-03-03 21:02:54,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:02:54,836 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:02:54,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i[919,932] [2025-03-03 21:02:54,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:02:54,877 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:02:54,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54 WrapperNode [2025-03-03 21:02:54,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:02:54,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:02:54,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:02:54,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:02:54,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,909 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-03-03 21:02:54,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:02:54,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:02:54,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:02:54,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:02:54,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,935 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:02:54,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:02:54,958 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:02:54,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:02:54,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:02:54,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (1/1) ... [2025-03-03 21:02:54,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:02:54,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:54,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:02:54,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:02:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:02:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:02:55,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:02:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:02:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:02:55,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:02:55,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:02:55,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:02:55,321 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: havoc property_#t~ite19#1;havoc property_#t~bitwise18#1; [2025-03-03 21:02:55,350 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 21:02:55,351 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:02:55,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:02:55,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:02:55,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:02:55 BoogieIcfgContainer [2025-03-03 21:02:55,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:02:55,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:02:55,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:02:55,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:02:55,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:02:54" (1/3) ... [2025-03-03 21:02:55,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4556472e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:02:55, skipping insertion in model container [2025-03-03 21:02:55,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:02:54" (2/3) ... [2025-03-03 21:02:55,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4556472e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:02:55, skipping insertion in model container [2025-03-03 21:02:55,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:02:55" (3/3) ... [2025-03-03 21:02:55,375 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2025-03-03 21:02:55,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:02:55,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:02:55,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:02:55,437 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4401e8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:02:55,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:02:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:02:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 21:02:55,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:55,451 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:55,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:55,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash -510095699, now seen corresponding path program 1 times [2025-03-03 21:02:55,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:55,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341690196] [2025-03-03 21:02:55,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:55,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:02:55,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:02:55,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:55,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 21:02:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341690196] [2025-03-03 21:02:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341690196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:02:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773901329] [2025-03-03 21:02:55,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:02:55,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:02:55,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:02:55,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:02:55,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:02:55,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:02:55,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:55,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:55,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:02:55,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:02:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 21:02:55,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:02:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773901329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:02:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:02:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049930952] [2025-03-03 21:02:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:02:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:55,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:02:55,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:02:55,944 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:02:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:55,965 INFO L93 Difference]: Finished difference Result 168 states and 291 transitions. [2025-03-03 21:02:55,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:02:55,966 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, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2025-03-03 21:02:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:55,970 INFO L225 Difference]: With dead ends: 168 [2025-03-03 21:02:55,970 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 21:02:55,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:02:55,974 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:55,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:02:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 21:02:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 21:02:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 21:02:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-03 21:02:56,000 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 170 [2025-03-03 21:02:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-03 21:02:56,000 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, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 21:02:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-03 21:02:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 21:02:56,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:56,006 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:56,012 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-03 21:02:56,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:02:56,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:56,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1341558387, now seen corresponding path program 1 times [2025-03-03 21:02:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:56,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903582483] [2025-03-03 21:02:56,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:56,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:02:56,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:02:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:02:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:56,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903582483] [2025-03-03 21:02:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903582483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:02:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104101747] [2025-03-03 21:02:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:56,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:02:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:56,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:02:56,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:02:56,967 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:02:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:57,201 INFO L93 Difference]: Finished difference Result 249 states and 379 transitions. [2025-03-03 21:02:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:02:57,202 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), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-03 21:02:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:57,204 INFO L225 Difference]: With dead ends: 249 [2025-03-03 21:02:57,204 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 21:02:57,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:02:57,205 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 90 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:57,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 301 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:02:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 21:02:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2025-03-03 21:02:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:02:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2025-03-03 21:02:57,248 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 170 [2025-03-03 21:02:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2025-03-03 21:02:57,249 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), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:02:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2025-03-03 21:02:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 21:02:57,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:57,252 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:57,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:02:57,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1122211206, now seen corresponding path program 1 times [2025-03-03 21:02:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532891301] [2025-03-03 21:02:57,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:57,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 21:02:57,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 21:02:57,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:57,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:02:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532891301] [2025-03-03 21:02:57,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532891301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:57,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:57,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:02:57,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248676605] [2025-03-03 21:02:57,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:57,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:02:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:57,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:02:57,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:02:57,505 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:02:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:02:57,696 INFO L93 Difference]: Finished difference Result 267 states and 402 transitions. [2025-03-03 21:02:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:02:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-03 21:02:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:02:57,699 INFO L225 Difference]: With dead ends: 267 [2025-03-03 21:02:57,700 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 21:02:57,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:02:57,701 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:02:57,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 310 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:02:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 21:02:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2025-03-03 21:02:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:02:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 234 transitions. [2025-03-03 21:02:57,731 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 234 transitions. Word has length 171 [2025-03-03 21:02:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:02:57,732 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 234 transitions. [2025-03-03 21:02:57,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:02:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 234 transitions. [2025-03-03 21:02:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:02:57,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:02:57,735 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:02:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:02:57,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:02:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:02:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 708836191, now seen corresponding path program 1 times [2025-03-03 21:02:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:02:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978658493] [2025-03-03 21:02:57,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:02:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:02:57,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:02:57,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:02:57,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:02:57,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:02:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:02:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:02:59,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978658493] [2025-03-03 21:02:59,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978658493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:02:59,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:02:59,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:02:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597191964] [2025-03-03 21:02:59,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:02:59,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:02:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:02:59,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:02:59,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:02:59,596 INFO L87 Difference]: Start difference. First operand 155 states and 234 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:03:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:03:00,401 INFO L93 Difference]: Finished difference Result 320 states and 461 transitions. [2025-03-03 21:03:00,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:03:00,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-03 21:03:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:03:00,405 INFO L225 Difference]: With dead ends: 320 [2025-03-03 21:03:00,405 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 21:03:00,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:03:00,407 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 260 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:03:00,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 414 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:03:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 21:03:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 167. [2025-03-03 21:03:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 21:03:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2025-03-03 21:03:00,429 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 172 [2025-03-03 21:03:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:03:00,430 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2025-03-03 21:03:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:03:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2025-03-03 21:03:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:03:00,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:00,432 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:00,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:03:00,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:00,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1088115168, now seen corresponding path program 1 times [2025-03-03 21:03:00,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:03:00,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841634790] [2025-03-03 21:03:00,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:03:00,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:03:00,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:03:00,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:00,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:03:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:03:06,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841634790] [2025-03-03 21:03:06,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841634790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:03:06,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:03:06,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:03:06,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344675631] [2025-03-03 21:03:06,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:03:06,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:03:06,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:03:06,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:03:06,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:03:06,654 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:03:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:03:09,010 INFO L93 Difference]: Finished difference Result 481 states and 710 transitions. [2025-03-03 21:03:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:03:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-03 21:03:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:03:09,013 INFO L225 Difference]: With dead ends: 481 [2025-03-03 21:03:09,013 INFO L226 Difference]: Without dead ends: 381 [2025-03-03 21:03:09,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 21:03:09,014 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 349 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:03:09,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 950 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:03:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-03 21:03:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 309. [2025-03-03 21:03:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 226 states have (on average 1.336283185840708) internal successors, (302), 226 states have internal predecessors, (302), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:03:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 458 transitions. [2025-03-03 21:03:09,046 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 458 transitions. Word has length 172 [2025-03-03 21:03:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:03:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 458 transitions. [2025-03-03 21:03:09,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:03:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 458 transitions. [2025-03-03 21:03:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 21:03:09,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:09,048 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:09,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:03:09,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1598649345, now seen corresponding path program 1 times [2025-03-03 21:03:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:03:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837175973] [2025-03-03 21:03:09,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:03:09,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:03:09,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:03:09,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 57 proven. 18 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:03:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:03:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837175973] [2025-03-03 21:03:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837175973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:03:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999345225] [2025-03-03 21:03:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:09,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:03:09,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:03:09,738 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-03 21:03:09,740 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-03 21:03:09,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 21:03:09,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 21:03:09,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:09,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:09,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 21:03:09,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:03:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 522 proven. 30 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2025-03-03 21:03:10,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:03:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 57 proven. 18 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:03:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999345225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:03:11,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:03:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 14 [2025-03-03 21:03:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728715342] [2025-03-03 21:03:11,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:03:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:03:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:03:11,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:03:11,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:03:11,809 INFO L87 Difference]: Start difference. First operand 309 states and 458 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-03 21:03:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:03:12,406 INFO L93 Difference]: Finished difference Result 558 states and 797 transitions. [2025-03-03 21:03:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:03:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 172 [2025-03-03 21:03:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:03:12,408 INFO L225 Difference]: With dead ends: 558 [2025-03-03 21:03:12,408 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 21:03:12,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:03:12,409 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 318 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:03:12,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 291 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:03:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 21:03:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 333. [2025-03-03 21:03:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 242 states have (on average 1.2685950413223142) internal successors, (307), 242 states have internal predecessors, (307), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:03:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 463 transitions. [2025-03-03 21:03:12,427 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 463 transitions. Word has length 172 [2025-03-03 21:03:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:03:12,428 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 463 transitions. [2025-03-03 21:03:12,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-03-03 21:03:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 463 transitions. [2025-03-03 21:03:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:03:12,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:12,429 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:12,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:03:12,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 21:03:12,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:12,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash 278353387, now seen corresponding path program 1 times [2025-03-03 21:03:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:03:12,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770792362] [2025-03-03 21:03:12,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:03:12,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:03:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:03:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 21:03:13,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:03:13,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770792362] [2025-03-03 21:03:13,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770792362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:03:13,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:03:13,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:03:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131702598] [2025-03-03 21:03:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:03:13,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:03:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:03:13,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:03:13,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:03:13,907 INFO L87 Difference]: Start difference. First operand 333 states and 463 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:03:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:03:14,461 INFO L93 Difference]: Finished difference Result 653 states and 891 transitions. [2025-03-03 21:03:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:03:14,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-03 21:03:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:03:14,465 INFO L225 Difference]: With dead ends: 653 [2025-03-03 21:03:14,465 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 21:03:14,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:03:14,466 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 401 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:03:14,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 688 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:03:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 21:03:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 338. [2025-03-03 21:03:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 247 states have (on average 1.271255060728745) internal successors, (314), 247 states have internal predecessors, (314), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 21:03:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 470 transitions. [2025-03-03 21:03:14,516 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 470 transitions. Word has length 173 [2025-03-03 21:03:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:03:14,516 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 470 transitions. [2025-03-03 21:03:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 21:03:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 470 transitions. [2025-03-03 21:03:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 21:03:14,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:03:14,518 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:03:14,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:03:14,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:03:14,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:03:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash 407436106, now seen corresponding path program 1 times [2025-03-03 21:03:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:03:14,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887455010] [2025-03-03 21:03:14,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:14,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:03:14,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:03:14,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:03:14,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:14,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-03 21:03:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:03:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887455010] [2025-03-03 21:03:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887455010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:03:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929176175] [2025-03-03 21:03:17,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:03:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:03:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:03:17,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:03:17,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:03:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 21:03:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 21:03:17,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:03:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:03:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 21:03:17,937 INFO L279 TraceCheckSpWp]: Computing forward predicates...